./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/inv_square-2.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_square-2.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 f1e69edbdce27e5f928ff7e136ee6812498ce7c35f38e45c8aa6d453823549eb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:07,572 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:07,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:07,621 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:07,622 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:07,625 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:07,626 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:07,629 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:07,631 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:07,636 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:07,636 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:07,637 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:07,638 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:07,641 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:07,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:07,645 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:07,646 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:07,646 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:07,648 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:07,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:07,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:07,656 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:07,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:07,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:07,661 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:07,661 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:07,662 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:07,663 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:07,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:07,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:07,664 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:07,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:07,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:07,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:07,669 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:07,669 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:07,670 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:07,670 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:07,670 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:07,671 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:07,671 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:07,672 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:24:07,694 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:07,694 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:07,695 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:07,695 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:07,696 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:07,696 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:07,697 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:07,697 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:07,697 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:07,697 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:07,698 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:07,698 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:24:07,698 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:07,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:07,699 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:07,699 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:07,699 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:07,699 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:07,700 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:07,700 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:07,700 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:07,700 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:07,700 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:07,701 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:07,701 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:07,701 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:07,701 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:07,701 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:07,702 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:24:07,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:24:07,702 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:07,702 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:07,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:07,703 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 -> f1e69edbdce27e5f928ff7e136ee6812498ce7c35f38e45c8aa6d453823549eb [2022-02-20 16:24:07,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:07,940 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:07,942 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:07,943 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:07,944 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:07,945 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_square-2.c [2022-02-20 16:24:07,992 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb5eb48d/b5bfc0fbb8c8449c965f3dcc6dae57eb/FLAG48a6053cf [2022-02-20 16:24:08,345 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:08,345 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_square-2.c [2022-02-20 16:24:08,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb5eb48d/b5bfc0fbb8c8449c965f3dcc6dae57eb/FLAG48a6053cf [2022-02-20 16:24:08,358 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8eb5eb48d/b5bfc0fbb8c8449c965f3dcc6dae57eb [2022-02-20 16:24:08,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:08,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:08,367 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:08,367 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:08,370 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:08,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c6b9a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08, skipping insertion in model container [2022-02-20 16:24:08,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,377 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:08,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:08,530 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_square-2.c[484,497] [2022-02-20 16:24:08,551 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:08,562 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:08,577 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_square-2.c[484,497] [2022-02-20 16:24:08,579 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:08,588 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:08,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08 WrapperNode [2022-02-20 16:24:08,589 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:08,590 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:08,590 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:08,590 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:08,595 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:24:08" (1/1) ... [2022-02-20 16:24:08,599 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:24:08" (1/1) ... [2022-02-20 16:24:08,613 INFO L137 Inliner]: procedures = 14, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 31 [2022-02-20 16:24:08,614 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:08,615 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:08,615 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:08,615 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:08,621 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,622 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,627 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:08,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:08,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:08,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:08,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (1/1) ... [2022-02-20 16:24:08,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:08,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:08,654 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:24:08,679 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:24:08,693 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:24:08,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:08,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:08,745 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:08,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:08,870 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:08,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:08,876 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:24:08,877 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:08 BoogieIcfgContainer [2022-02-20 16:24:08,877 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:08,878 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:08,878 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:08,881 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:08,881 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:08" (1/3) ... [2022-02-20 16:24:08,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a17c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:08, skipping insertion in model container [2022-02-20 16:24:08,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:08" (2/3) ... [2022-02-20 16:24:08,883 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32a17c40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:08, skipping insertion in model container [2022-02-20 16:24:08,883 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:08" (3/3) ... [2022-02-20 16:24:08,884 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_square-2.c [2022-02-20 16:24:08,888 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:08,889 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:08,937 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:08,941 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:24:08,942 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:08,957 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:24:08,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:24:08,964 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:08,964 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:08,964 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966375, now seen corresponding path program 1 times [2022-02-20 16:24:08,976 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:24:08,976 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383508283] [2022-02-20 16:24:08,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:08,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:24:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:09,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#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); {16#true} is VALID [2022-02-20 16:24:09,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(1.0)) && ~someBinaryFLOATComparisonOperation(main_~x~0#1, 1.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; {16#true} is VALID [2022-02-20 16:24:09,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {17#false} is VALID [2022-02-20 16:24:09,086 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#false} assume { :end_inline_assume_abort_if_not } true; {17#false} is VALID [2022-02-20 16:24:09,086 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume ~someBinaryFLOATComparisonOperation(main_~x~0#1, ~someUnaryFLOAToperation(1.0E-20)) || ~someBinaryFLOATComparisonOperation(main_~x~0#1, 1.0E-20);main_~y~0#1 := ~someBinaryArithmeticFLOAToperation(main_~x~0#1, main_~x~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if ~someBinaryFLOATComparisonOperation(main_~y~0#1, 0.0) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17#false} is VALID [2022-02-20 16:24:09,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0 == __VERIFIER_assert_~cond#1; {17#false} is VALID [2022-02-20 16:24:09,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 16:24:09,088 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:24:09,088 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:24:09,089 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383508283] [2022-02-20 16:24:09,089 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383508283] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:09,090 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:09,090 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:24:09,091 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38813421] [2022-02-20 16:24:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:09,096 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:09,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:09,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:09,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:09,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:24:09,110 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:24:09,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:24:09,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:09,132 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:09,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:09,154 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:24:09,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:24:09,154 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:09,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:09,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:09,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-02-20 16:24:09,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:09,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-02-20 16:24:09,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2022-02-20 16:24:09,219 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:09,234 INFO L225 Difference]: With dead ends: 23 [2022-02-20 16:24:09,244 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:24:09,247 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:24:09,250 INFO L933 BasicCegarLoop]: 13 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, 13 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:24:09,252 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:24:09,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:24:09,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:24:09,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:09,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:09,271 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:09,271 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:09,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:09,275 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:24:09,275 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:09,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:09,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:09,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 8 states. [2022-02-20 16:24:09,276 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 8 states. [2022-02-20 16:24:09,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:09,277 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:24:09,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:09,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:09,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:09,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:09,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:09,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:09,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2022-02-20 16:24:09,281 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2022-02-20 16:24:09,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:09,281 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2022-02-20 16:24:09,281 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:09,282 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:09,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:24:09,282 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:09,282 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:09,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:24:09,283 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:09,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:09,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1806813417, now seen corresponding path program 1 times [2022-02-20 16:24:09,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:24:09,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710916447] [2022-02-20 16:24:09,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:09,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:24:09,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:09,304 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:24:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:24:09,327 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:24:09,328 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:24:09,329 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:24:09,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:24:09,334 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:24:09,336 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:24:09,351 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:24:09,351 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:24:09,351 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:24:09,352 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:24:09,353 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 16:24:09,353 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 16:24:09,353 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2022-02-20 16:24:09,353 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:24:09,353 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:24:09,353 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:24:09,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:24:09 BoogieIcfgContainer [2022-02-20 16:24:09,354 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:24:09,355 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:24:09,355 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:24:09,355 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:24:09,356 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:08" (3/4) ... [2022-02-20 16:24:09,358 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:24:09,358 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:24:09,359 INFO L158 Benchmark]: Toolchain (without parser) took 998.05ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 80.0MB in the beginning and 100.9MB in the end (delta: -20.9MB). Peak memory consumption was 3.7MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,360 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 109.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:09,360 INFO L158 Benchmark]: CACSL2BoogieTranslator took 221.89ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 83.8MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,361 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.47ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,361 INFO L158 Benchmark]: Boogie Preprocessor took 13.94ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 81.3MB in the end (delta: 872.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,362 INFO L158 Benchmark]: RCFGBuilder took 248.11ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 72.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:24:09,362 INFO L158 Benchmark]: TraceAbstraction took 475.92ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 72.1MB in the beginning and 100.9MB in the end (delta: -28.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:09,363 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 134.2MB. Free memory is still 100.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:09,365 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.17ms. Allocated memory is still 109.1MB. Free memory is still 64.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 221.89ms. Allocated memory is still 109.1MB. Free memory was 80.0MB in the beginning and 83.8MB in the end (delta: -3.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.47ms. Allocated memory is still 109.1MB. Free memory was 83.8MB in the beginning and 82.5MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 13.94ms. Allocated memory is still 109.1MB. Free memory was 82.1MB in the beginning and 81.3MB in the end (delta: 872.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 248.11ms. Allocated memory is still 109.1MB. Free memory was 81.3MB in the beginning and 72.5MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 475.92ms. Allocated memory was 109.1MB in the beginning and 134.2MB in the end (delta: 25.2MB). Free memory was 72.1MB in the beginning and 100.9MB in the end (delta: -28.8MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.33ms. Allocated memory is still 134.2MB. Free memory is still 100.9MB. 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: 13]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 22, overapproximation of someBinaryArithmeticFLOAToperation at line 23. Possible FailurePath: [L17] float x, y, z; [L19] x = __VERIFIER_nondet_float() [L20] CALL assume_abort_if_not(x >= -1.f && x <= 1.f) [L11] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L20] RET assume_abort_if_not(x >= -1.f && x <= 1.f) [L22] COND TRUE x <= -1e-20f || x >= 1e-20f [L23] y = x * x [L24] CALL __VERIFIER_assert(y != 0.f) [L13] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L13] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 13 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 6 ConstructedInterpolants, 0 QuantifiedInterpolants, 6 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-02-20 16:24:09,395 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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_square-2.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 f1e69edbdce27e5f928ff7e136ee6812498ce7c35f38e45c8aa6d453823549eb --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:24:11,252 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:24:11,255 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:24:11,289 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:24:11,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:24:11,292 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:24:11,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:24:11,298 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:24:11,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:24:11,304 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:24:11,305 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:24:11,306 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:24:11,307 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:24:11,308 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:24:11,309 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:24:11,314 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:24:11,315 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:24:11,316 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:24:11,318 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:24:11,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:24:11,323 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:24:11,324 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:24:11,326 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:24:11,327 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:24:11,332 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:24:11,333 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:24:11,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:24:11,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:24:11,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:24:11,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:24:11,335 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:24:11,336 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:24:11,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:24:11,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:24:11,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:24:11,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:24:11,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:24:11,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:24:11,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:24:11,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:24:11,342 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:24:11,343 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:24:11,378 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:24:11,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:24:11,380 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:24:11,380 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:24:11,381 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:24:11,381 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:24:11,382 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:24:11,382 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:24:11,382 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:24:11,383 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:24:11,383 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:24:11,383 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:24:11,384 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:24:11,384 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:24:11,384 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:24:11,384 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:24:11,384 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:24:11,385 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:24:11,386 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:24:11,386 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:24:11,386 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:24:11,396 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:11,396 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:24:11,396 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:24:11,396 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:24:11,397 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:24:11,397 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:24:11,397 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:24:11,397 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:24:11,398 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:24:11,398 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:24:11,398 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 -> f1e69edbdce27e5f928ff7e136ee6812498ce7c35f38e45c8aa6d453823549eb [2022-02-20 16:24:11,689 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:24:11,722 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:24:11,724 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:24:11,725 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:24:11,725 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:24:11,726 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/inv_square-2.c [2022-02-20 16:24:11,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a7a0368/ad0a153224294173b5a7980f60a03d13/FLAG1c467b02d [2022-02-20 16:24:12,168 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:24:12,169 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/inv_square-2.c [2022-02-20 16:24:12,176 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a7a0368/ad0a153224294173b5a7980f60a03d13/FLAG1c467b02d [2022-02-20 16:24:12,583 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/85a7a0368/ad0a153224294173b5a7980f60a03d13 [2022-02-20 16:24:12,585 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:24:12,586 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:24:12,589 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:12,589 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:24:12,593 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:24:12,593 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,595 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71bdc93a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12, skipping insertion in model container [2022-02-20 16:24:12,596 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:24:12,612 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:24:12,711 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_square-2.c[484,497] [2022-02-20 16:24:12,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:12,730 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:24:12,740 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_square-2.c[484,497] [2022-02-20 16:24:12,758 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:24:12,798 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:24:12,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12 WrapperNode [2022-02-20 16:24:12,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:24:12,803 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:12,803 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:24:12,803 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:24:12,808 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:24:12" (1/1) ... [2022-02-20 16:24:12,814 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:24:12" (1/1) ... [2022-02-20 16:24:12,828 INFO L137 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 32 [2022-02-20 16:24:12,829 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:24:12,830 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:24:12,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:24:12,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:24:12,836 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,836 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,845 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,848 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:24:12,849 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:24:12,849 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:24:12,849 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:24:12,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (1/1) ... [2022-02-20 16:24:12,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:24:12,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:24:12,877 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:24:12,878 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:24:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:24:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:24:12,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:24:12,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:24:12,956 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:24:12,957 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:24:13,703 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:24:13,708 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:24:13,708 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:24:13,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:13 BoogieIcfgContainer [2022-02-20 16:24:13,709 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:24:13,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:24:13,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:24:13,713 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:24:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:24:12" (1/3) ... [2022-02-20 16:24:13,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ec7874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:13, skipping insertion in model container [2022-02-20 16:24:13,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:24:12" (2/3) ... [2022-02-20 16:24:13,715 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74ec7874 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:24:13, skipping insertion in model container [2022-02-20 16:24:13,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:13" (3/3) ... [2022-02-20 16:24:13,716 INFO L111 eAbstractionObserver]: Analyzing ICFG inv_square-2.c [2022-02-20 16:24:13,720 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:24:13,720 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:24:13,758 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:24:13,763 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:24:13,763 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:24:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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:24:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:24:13,778 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:13,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:13,779 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:13,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:13,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1804966375, now seen corresponding path program 1 times [2022-02-20 16:24:13,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:13,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992593396] [2022-02-20 16:24:13,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:13,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:13,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:13,799 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:24:13,811 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:24:13,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:24:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:13,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:13,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#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); {16#true} is VALID [2022-02-20 16:24:13,949 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0))) && ~fp.leq~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.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; {16#true} is VALID [2022-02-20 16:24:13,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {16#true} assume 0bv32 == assume_abort_if_not_~cond#1;assume false; {17#false} is VALID [2022-02-20 16:24:13,950 INFO L290 TraceCheckUtils]: 3: Hoare triple {17#false} assume { :end_inline_assume_abort_if_not } true; {17#false} is VALID [2022-02-20 16:24:13,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {17#false} assume ~fp.leq~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0E-20))) || ~fp.geq~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0E-20));main_~y~0#1 := ~fp.mul~FLOAT(currentRoundingMode, main_~x~0#1, main_~x~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if !~fp.eq~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {17#false} is VALID [2022-02-20 16:24:13,951 INFO L290 TraceCheckUtils]: 5: Hoare triple {17#false} assume 0bv32 == __VERIFIER_assert_~cond#1; {17#false} is VALID [2022-02-20 16:24:13,951 INFO L290 TraceCheckUtils]: 6: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 16:24:13,952 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:24:13,952 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:13,953 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:13,953 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992593396] [2022-02-20 16:24:13,954 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [992593396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:13,954 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:13,954 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:24:13,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995521624] [2022-02-20 16:24:13,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:13,963 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:13,964 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:13,966 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:14,009 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:14,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:24:14,010 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:14,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:24:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:14,035 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 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 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:16,049 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:24:16,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:24:16,049 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:16,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:16,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-02-20 16:24:16,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 26 transitions. [2022-02-20 16:24:16,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 26 transitions. [2022-02-20 16:24:16,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:16,341 INFO L225 Difference]: With dead ends: 23 [2022-02-20 16:24:16,341 INFO L226 Difference]: Without dead ends: 8 [2022-02-20 16:24:16,343 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:24:16,346 INFO L933 BasicCegarLoop]: 13 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, 13 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:24:16,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:24:16,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2022-02-20 16:24:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2022-02-20 16:24:16,364 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:16,364 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:16,365 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:16,365 INFO L87 Difference]: Start difference. First operand 8 states. Second operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:16,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:16,366 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:24:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:16,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:16,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:16,367 INFO L74 IsIncluded]: Start isIncluded. First operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 8 states. [2022-02-20 16:24:16,368 INFO L87 Difference]: Start difference. First operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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 8 states. [2022-02-20 16:24:16,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:16,369 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:24:16,369 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:16,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:16,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:16,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:16,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:16,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.0) internal successors, (7), 7 states have internal predecessors, (7), 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:24:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 7 transitions. [2022-02-20 16:24:16,372 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 7 transitions. Word has length 7 [2022-02-20 16:24:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:16,372 INFO L470 AbstractCegarLoop]: Abstraction has 8 states and 7 transitions. [2022-02-20 16:24:16,372 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:24:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 7 transitions. [2022-02-20 16:24:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:24:16,373 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:24:16,373 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:24:16,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:16,584 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:24:16,584 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:24:16,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:24:16,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1806813417, now seen corresponding path program 1 times [2022-02-20 16:24:16,586 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:24:16,586 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [402846664] [2022-02-20 16:24:16,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:24:16,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:24:16,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:24:16,588 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:24:16,589 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:24:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:16,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:24:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:24:17,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:24:19,069 INFO L290 TraceCheckUtils]: 0: Hoare triple {89#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); {94#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:24:19,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {94#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~x~0#1, main_~y~0#1, main_~z~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~z~0#1;main_~x~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~fp.geq~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0))) && ~fp.leq~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.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; {98#(and (or (and (or (not (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (not (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:19,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {98#(and (or (and (or (not (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0)))) (not (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv0 32))) (and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| (_ bv1 32)))) (= currentRoundingMode roundNearestTiesToEven))} assume !(0bv32 == assume_abort_if_not_~cond#1); {102#(and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:19,074 INFO L290 TraceCheckUtils]: 3: Hoare triple {102#(and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume { :end_inline_assume_abort_if_not } true; {102#(and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:24:19,976 INFO L290 TraceCheckUtils]: 4: Hoare triple {102#(and (fp.leq |ULTIMATE.start_main_~x~0#1| ((_ to_fp 8 24) currentRoundingMode 1.0)) (fp.geq |ULTIMATE.start_main_~x~0#1| (fp.neg ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~FLOAT(main_~x~0#1, ~fp.neg~FLOAT(~to_fp~FLOAT(currentRoundingMode, 1.0E-20))) || ~fp.geq~FLOAT(main_~x~0#1, ~to_fp~FLOAT(currentRoundingMode, 1.0E-20));main_~y~0#1 := ~fp.mul~FLOAT(currentRoundingMode, main_~x~0#1, main_~x~0#1);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if !~fp.eq~FLOAT(main_~y~0#1, ~Pluszero~FLOAT()) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {109#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} is VALID [2022-02-20 16:24:19,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {109#(= |ULTIMATE.start___VERIFIER_assert_~cond#1| (_ bv1 32))} assume 0bv32 == __VERIFIER_assert_~cond#1; {90#false} is VALID [2022-02-20 16:24:19,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {90#false} assume !false; {90#false} is VALID [2022-02-20 16:24:19,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:24:19,978 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:24:19,978 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:24:19,978 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [402846664] [2022-02-20 16:24:19,978 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [402846664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:24:19,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:24:19,978 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:24:19,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817096551] [2022-02-20 16:24:19,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:24:19,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:19,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:24:19,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:24:20,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:20,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:24:20,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:24:20,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:24:20,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:24:20,918 INFO L87 Difference]: Start difference. First operand 8 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:24:21,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:21,286 INFO L93 Difference]: Finished difference Result 8 states and 7 transitions. [2022-02-20 16:24:21,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:24:21,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-02-20 16:24:21,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:24:21,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:24:21,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-02-20 16:24:21,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:24:21,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 7 transitions. [2022-02-20 16:24:21,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 7 transitions. [2022-02-20 16:24:21,875 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:24:21,875 INFO L225 Difference]: With dead ends: 8 [2022-02-20 16:24:21,875 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 16:24:21,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:24:21,877 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 5 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:24:21,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 4 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:24:21,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 16:24:21,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 16:24:21,878 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:24:21,878 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:21,878 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:21,878 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:21,879 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:24:21,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:24:21,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:21,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:21,879 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:24:21,879 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 16:24:21,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:24:21,880 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 16:24:21,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:24:21,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:21,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:24:21,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:24:21,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:24:21,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:24:21,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 16:24:21,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 7 [2022-02-20 16:24:21,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:24:21,881 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 16:24:21,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 5 states have internal predecessors, (7), 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:24:21,881 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 16:24:21,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:24:21,883 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:24:21,894 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:24:22,084 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:24:22,086 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 16:24:22,091 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 16:24:22,092 INFO L861 garLoopResultBuilder]: At program point L27(lines 15 28) the Hoare annotation is: true [2022-02-20 16:24:22,092 INFO L858 garLoopResultBuilder]: For program point L13(line 13) no Hoare annotation was computed. [2022-02-20 16:24:22,092 INFO L858 garLoopResultBuilder]: For program point L13-1(line 13) no Hoare annotation was computed. [2022-02-20 16:24:22,092 INFO L858 garLoopResultBuilder]: For program point L11(line 11) no Hoare annotation was computed. [2022-02-20 16:24:22,092 INFO L861 garLoopResultBuilder]: At program point L13-3(line 13) the Hoare annotation is: true [2022-02-20 16:24:22,092 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point L22(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point L22-2(lines 22 26) no Hoare annotation was computed. [2022-02-20 16:24:22,093 INFO L858 garLoopResultBuilder]: For program point L10(lines 10 12) no Hoare annotation was computed. [2022-02-20 16:24:22,098 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:24:22,099 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:24:22,102 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:24:22,102 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:24:22,102 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:24:22,102 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2022-02-20 16:24:22,103 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2022-02-20 16:24:22,103 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:24:22,103 WARN L170 areAnnotationChecker]: L22 has no Hoare annotation [2022-02-20 16:24:22,103 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:24:22,105 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-02-20 16:24:22,105 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:24:22,105 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 16:24:22,106 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2022-02-20 16:24:22,106 WARN L170 areAnnotationChecker]: L22-2 has no Hoare annotation [2022-02-20 16:24:22,106 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:24:22,106 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:24:22,106 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:24:22,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:24:22 BoogieIcfgContainer [2022-02-20 16:24:22,110 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:24:22,110 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:24:22,110 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:24:22,111 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:24:22,111 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:24:13" (3/4) ... [2022-02-20 16:24:22,113 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 16:24:22,123 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2022-02-20 16:24:22,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 16:24:22,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 16:24:22,126 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 16:24:22,160 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:24:22,161 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:24:22,162 INFO L158 Benchmark]: Toolchain (without parser) took 9575.51ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 35.5MB in the beginning and 43.0MB in the end (delta: -7.5MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2022-02-20 16:24:22,162 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:22,163 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.68ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 35.2MB in the beginning and 57.3MB in the end (delta: -22.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 16:24:22,163 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.38ms. Allocated memory is still 73.4MB. Free memory was 57.1MB in the beginning and 55.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:22,168 INFO L158 Benchmark]: Boogie Preprocessor took 18.92ms. Allocated memory is still 73.4MB. Free memory was 55.6MB in the beginning and 54.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:24:22,169 INFO L158 Benchmark]: RCFGBuilder took 860.42ms. Allocated memory is still 73.4MB. Free memory was 54.3MB in the beginning and 45.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:24:22,169 INFO L158 Benchmark]: TraceAbstraction took 8398.69ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 45.1MB in the end (delta: 244.6kB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. [2022-02-20 16:24:22,170 INFO L158 Benchmark]: Witness Printer took 50.71ms. Allocated memory is still 73.4MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:24:22,172 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.16ms. Allocated memory is still 56.6MB. Free memory was 38.2MB in the beginning and 38.2MB in the end (delta: 44.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.68ms. Allocated memory was 56.6MB in the beginning and 73.4MB in the end (delta: 16.8MB). Free memory was 35.2MB in the beginning and 57.3MB in the end (delta: -22.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.38ms. Allocated memory is still 73.4MB. Free memory was 57.1MB in the beginning and 55.6MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.92ms. Allocated memory is still 73.4MB. Free memory was 55.6MB in the beginning and 54.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 860.42ms. Allocated memory is still 73.4MB. Free memory was 54.3MB in the beginning and 45.7MB in the end (delta: 8.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8398.69ms. Allocated memory is still 73.4MB. Free memory was 45.3MB in the beginning and 45.1MB in the end (delta: 244.6kB). Peak memory consumption was 3.9MB. Max. memory is 16.1GB. * Witness Printer took 50.71ms. Allocated memory is still 73.4MB. Free memory was 45.1MB in the beginning and 43.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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 - PositiveResult [Line: 13]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5 mSDsluCounter, 17 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8 IncrementalHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 15 mSDtfsCounter, 8 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 8, 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: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 2 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 14 NumberOfCodeBlocks, 14 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 81 SizeOfPredicates, 6 NumberOfNonLiveVariables, 50 ConjunctsInSsa, 10 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 16:24:22,226 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE