./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:20:14,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:20:14,466 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:20:14,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:20:14,506 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:20:14,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:20:14,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:20:14,529 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:20:14,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:20:14,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:20:14,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:20:14,533 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:20:14,533 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:20:14,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:20:14,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:20:14,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:20:14,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:20:14,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:20:14,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:20:14,541 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:20:14,543 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:20:14,544 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:20:14,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:20:14,556 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:20:14,560 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:20:14,567 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:20:14,567 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:20:14,568 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:20:14,568 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:20:14,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:20:14,572 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:20:14,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:20:14,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:20:14,575 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:20:14,576 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:20:14,577 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:20:14,577 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:20:14,578 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:20:14,578 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:20:14,579 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:20:14,580 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:20:14,581 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 06:20:14,613 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:20:14,613 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:20:14,614 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:20:14,614 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:20:14,614 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:20:14,615 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:20:14,615 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:20:14,615 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:20:14,615 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:20:14,616 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:20:14,616 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:20:14,617 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 06:20:14,617 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:20:14,617 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:20:14,618 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:20:14,619 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:20:14,619 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:20:14,619 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:20:14,619 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:20:14,619 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:14,620 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:20:14,620 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:20:14,620 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:20:14,620 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 06:20:14,620 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 06:20:14,621 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:20:14,621 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:20:14,621 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:20:14,621 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:20:14,621 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2021-12-17 06:20:14,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:20:14,839 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:20:14,842 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:20:14,843 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:20:14,843 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:20:14,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:14,888 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dde47bd/1c7f396daf85437994dec4b46011f89b/FLAG89c985c05 [2021-12-17 06:20:15,245 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:20:15,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:15,254 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dde47bd/1c7f396daf85437994dec4b46011f89b/FLAG89c985c05 [2021-12-17 06:20:15,684 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/25dde47bd/1c7f396daf85437994dec4b46011f89b [2021-12-17 06:20:15,687 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:20:15,689 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:20:15,690 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:15,690 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:20:15,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:20:15,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,696 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53f7f971 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15, skipping insertion in model container [2021-12-17 06:20:15,696 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,702 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:20:15,715 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:20:15,827 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2021-12-17 06:20:15,830 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:15,837 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:20:15,848 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2021-12-17 06:20:15,849 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:15,859 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:20:15,860 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15 WrapperNode [2021-12-17 06:20:15,860 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:15,861 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:15,861 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:20:15,861 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:20:15,867 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,872 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,883 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2021-12-17 06:20:15,883 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:15,884 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:20:15,884 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:20:15,884 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:20:15,890 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,890 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,891 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,897 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,900 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,902 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:20:15,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:20:15,904 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:20:15,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:20:15,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (1/1) ... [2021-12-17 06:20:15,910 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:15,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:15,930 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:20:15,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:20:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:20:15,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:20:15,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:20:15,963 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 06:20:16,009 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:20:16,010 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:20:16,094 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:20:16,097 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:20:16,098 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:20:16,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:16 BoogieIcfgContainer [2021-12-17 06:20:16,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:20:16,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:20:16,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:20:16,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:20:16,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:20:15" (1/3) ... [2021-12-17 06:20:16,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4414ded7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:16, skipping insertion in model container [2021-12-17 06:20:16,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:15" (2/3) ... [2021-12-17 06:20:16,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4414ded7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:16, skipping insertion in model container [2021-12-17 06:20:16,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:16" (3/3) ... [2021-12-17 06:20:16,106 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:16,110 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:20:16,110 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:20:16,147 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:20:16,152 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:20:16,152 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:20:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-17 06:20:16,165 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:16,166 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-17 06:20:16,166 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:16,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:16,170 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-12-17 06:20:16,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:16,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453458328] [2021-12-17 06:20:16,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:16,186 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:16,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:16,292 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:16,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453458328] [2021-12-17 06:20:16,292 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453458328] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:20:16,293 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:20:16,293 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:20:16,294 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197956201] [2021-12-17 06:20:16,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:20:16,298 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:20:16,298 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:16,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:20:16,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:16,321 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:16,336 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-12-17 06:20:16,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:20:16,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2021-12-17 06:20:16,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:16,343 INFO L225 Difference]: With dead ends: 16 [2021-12-17 06:20:16,343 INFO L226 Difference]: Without dead ends: 7 [2021-12-17 06:20:16,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:16,348 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:16,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:16,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-12-17 06:20:16,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-17 06:20:16,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2021-12-17 06:20:16,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-12-17 06:20:16,372 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-12-17 06:20:16,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:16,372 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-12-17 06:20:16,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-12-17 06:20:16,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 06:20:16,373 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:16,374 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 06:20:16,374 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-17 06:20:16,374 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:16,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2021-12-17 06:20:16,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:16,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094513805] [2021-12-17 06:20:16,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:16,376 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:16,410 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:16,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094513805] [2021-12-17 06:20:16,410 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094513805] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:20:16,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452908093] [2021-12-17 06:20:16,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:16,411 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:16,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:16,413 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 06:20:16,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 06:20:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:16,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:20:16,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:16,575 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:16,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:16,618 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:16,619 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452908093] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:16,623 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 06:20:16,623 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2021-12-17 06:20:16,624 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433832394] [2021-12-17 06:20:16,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:16,626 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-17 06:20:16,626 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:16,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-17 06:20:16,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:16,627 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:16,648 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-12-17 06:20:16,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:20:16,649 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-17 06:20:16,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:16,649 INFO L225 Difference]: With dead ends: 13 [2021-12-17 06:20:16,650 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 06:20:16,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:16,653 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:16,656 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:16,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 06:20:16,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-17 06:20:16,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-12-17 06:20:16,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2021-12-17 06:20:16,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:16,662 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-12-17 06:20:16,665 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:16,667 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-12-17 06:20:16,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 06:20:16,667 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:16,668 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2021-12-17 06:20:16,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:16,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:16,883 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:16,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:16,884 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2021-12-17 06:20:16,884 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:16,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742824694] [2021-12-17 06:20:16,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:16,885 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:16,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:16,942 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 06:20:16,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742824694] [2021-12-17 06:20:16,942 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742824694] provided 0 perfect and 1 imperfect interpolant sequences [2021-12-17 06:20:16,943 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1389651557] [2021-12-17 06:20:16,943 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 06:20:16,943 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 06:20:16,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:16,944 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 06:20:16,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 06:20:16,995 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 06:20:16,996 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:20:16,996 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 06:20:16,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:17,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:17,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:17,104 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:17,105 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1389651557] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:17,105 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2021-12-17 06:20:17,105 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2021-12-17 06:20:17,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166405419] [2021-12-17 06:20:17,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:17,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2021-12-17 06:20:17,106 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 06:20:17,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-12-17 06:20:17,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-17 06:20:17,108 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:17,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:17,127 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2021-12-17 06:20:17,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:20:17,127 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-12-17 06:20:17,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:17,128 INFO L225 Difference]: With dead ends: 19 [2021-12-17 06:20:17,128 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 06:20:17,128 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2021-12-17 06:20:17,129 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:17,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 17 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 06:20:17,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 06:20:17,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-17 06:20:17,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:17,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-12-17 06:20:17,146 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2021-12-17 06:20:17,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:17,146 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-12-17 06:20:17,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 13 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:17,147 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-12-17 06:20:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 06:20:17,147 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:17,147 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2021-12-17 06:20:17,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:17,351 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2021-12-17 06:20:17,352 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:17,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:17,352 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2021-12-17 06:20:17,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 06:20:17,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638907218] [2021-12-17 06:20:17,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:17,353 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 06:20:17,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:20:17,379 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 06:20:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 06:20:17,422 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 06:20:17,422 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 06:20:17,423 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:20:17,424 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-17 06:20:17,427 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1] [2021-12-17 06:20:17,436 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:20:17,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:20:17 BoogieIcfgContainer [2021-12-17 06:20:17,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:20:17,455 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:20:17,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:20:17,456 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:20:17,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:16" (3/4) ... [2021-12-17 06:20:17,458 INFO L140 WitnessPrinter]: No result that supports witness generation found [2021-12-17 06:20:17,459 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:20:17,459 INFO L158 Benchmark]: Toolchain (without parser) took 1770.29ms. Allocated memory is still 119.5MB. Free memory was 89.0MB in the beginning and 54.9MB in the end (delta: 34.1MB). Peak memory consumption was 35.6MB. Max. memory is 16.1GB. [2021-12-17 06:20:17,459 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:17,460 INFO L158 Benchmark]: CACSL2BoogieTranslator took 170.15ms. Allocated memory is still 119.5MB. Free memory was 88.9MB in the beginning and 79.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 06:20:17,460 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.47ms. Allocated memory is still 119.5MB. Free memory was 79.2MB in the beginning and 77.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:17,460 INFO L158 Benchmark]: Boogie Preprocessor took 19.07ms. Allocated memory is still 119.5MB. Free memory was 77.9MB in the beginning and 77.0MB in the end (delta: 837.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 06:20:17,461 INFO L158 Benchmark]: RCFGBuilder took 195.37ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 68.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 06:20:17,461 INFO L158 Benchmark]: TraceAbstraction took 1354.81ms. Allocated memory is still 119.5MB. Free memory was 68.1MB in the beginning and 55.3MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2021-12-17 06:20:17,461 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 119.5MB. Free memory is still 54.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:20:17,463 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 54.7MB in the beginning and 54.7MB in the end (delta: 40.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 170.15ms. Allocated memory is still 119.5MB. Free memory was 88.9MB in the beginning and 79.4MB in the end (delta: 9.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.47ms. Allocated memory is still 119.5MB. Free memory was 79.2MB in the beginning and 77.9MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.07ms. Allocated memory is still 119.5MB. Free memory was 77.9MB in the beginning and 77.0MB in the end (delta: 837.3kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 195.37ms. Allocated memory is still 119.5MB. Free memory was 76.9MB in the beginning and 68.6MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1354.81ms. Allocated memory is still 119.5MB. Free memory was 68.1MB in the beginning and 55.3MB in the end (delta: 12.8MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 119.5MB. Free memory is still 54.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: 29]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 24, overapproximation of someBinaryArithmeticFLOAToperation at line 16. Possible FailurePath: [L1] int __return_main; VAL [__return_main=0] [L9] float main__tick = 0.10000000149011612; [L10] float main__time = 0.0; [L11] int main__i; [L12] main__i = 0 VAL [__return_main=0, main__i=0, main__tick=2500000037252903/25000000000000000, main__time=0] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=1, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=2, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=3, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=4, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=5, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=6, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=7, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=8, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=9, main__tick=2500000037252903/25000000000000000] [L14] COND TRUE main__i < 10 [L16] main__time = main__time + main__tick [L17] main__i = main__i + 1 VAL [__return_main=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L14] COND FALSE !(main__i < 10) [L23] int __tmp_1; [L24] __tmp_1 = main__time != 1.0 [L25] int __VERIFIER_assert__cond; [L26] __VERIFIER_assert__cond = __tmp_1 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L27] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] [L29] reach_error() VAL [__return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main__i=10, main__tick=2500000037252903/25000000000000000] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, 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, 42 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24 mSDsCounter, 11 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 27 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 11 mSolverCounterUnsat, 18 mSDtfsCounter, 27 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=3, InterpolantAutomatonStates: 21, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 50 NumberOfCodeBlocks, 50 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 43 ConstructedInterpolants, 0 QuantifiedInterpolants, 87 SizeOfPredicates, 0 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 0/33 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2021-12-17 06:20:17,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.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 ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 06:20:19,341 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 06:20:19,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 06:20:19,382 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 06:20:19,382 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 06:20:19,385 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 06:20:19,387 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 06:20:19,391 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 06:20:19,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 06:20:19,397 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 06:20:19,402 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 06:20:19,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 06:20:19,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 06:20:19,408 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 06:20:19,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 06:20:19,412 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 06:20:19,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 06:20:19,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 06:20:19,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 06:20:19,420 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 06:20:19,421 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 06:20:19,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 06:20:19,424 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 06:20:19,425 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 06:20:19,431 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 06:20:19,431 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 06:20:19,432 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 06:20:19,433 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 06:20:19,433 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 06:20:19,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 06:20:19,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 06:20:19,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 06:20:19,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 06:20:19,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 06:20:19,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 06:20:19,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 06:20:19,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 06:20:19,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 06:20:19,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 06:20:19,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 06:20:19,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 06:20:19,446 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2021-12-17 06:20:19,481 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 06:20:19,481 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 06:20:19,482 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 06:20:19,483 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 06:20:19,483 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 06:20:19,484 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 06:20:19,484 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 06:20:19,485 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 06:20:19,485 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 06:20:19,485 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 06:20:19,486 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 06:20:19,486 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 06:20:19,486 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 06:20:19,486 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 06:20:19,487 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 06:20:19,487 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 06:20:19,487 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-12-17 06:20:19,487 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2021-12-17 06:20:19,487 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2021-12-17 06:20:19,488 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 06:20:19,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 06:20:19,488 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 06:20:19,488 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 06:20:19,488 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 06:20:19,488 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 06:20:19,489 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 06:20:19,489 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:19,489 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 06:20:19,489 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 06:20:19,489 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 06:20:19,490 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2021-12-17 06:20:19,490 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2021-12-17 06:20:19,490 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 06:20:19,490 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 06:20:19,490 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 06:20:19,491 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 06:20:19,491 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-12-17 06:20:19,491 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 -> ee159be1ed42c29b70080447b490f7a1aeb72331afc90e5794e0e8d61cb20d74 [2021-12-17 06:20:19,807 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 06:20:19,826 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 06:20:19,828 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 06:20:19,829 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 06:20:19,830 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 06:20:19,831 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:19,884 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0874c135b/2e9a5f796936491c99647ccd47c6ad70/FLAG7f13a8087 [2021-12-17 06:20:20,272 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 06:20:20,273 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:20,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0874c135b/2e9a5f796936491c99647ccd47c6ad70/FLAG7f13a8087 [2021-12-17 06:20:20,291 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0874c135b/2e9a5f796936491c99647ccd47c6ad70 [2021-12-17 06:20:20,293 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 06:20:20,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 06:20:20,297 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:20,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 06:20:20,300 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 06:20:20,301 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,302 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@134dee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 06:20:20,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 06:20:20,475 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2021-12-17 06:20:20,481 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:20,491 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 06:20:20,508 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/drift_tenth.c.p+cfa-reducer.c[721,734] [2021-12-17 06:20:20,508 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 06:20:20,540 INFO L208 MainTranslator]: Completed translation [2021-12-17 06:20:20,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20 WrapperNode [2021-12-17 06:20:20,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 06:20:20,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:20,564 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 06:20:20,564 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 06:20:20,570 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,577 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,591 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2021-12-17 06:20:20,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 06:20:20,593 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 06:20:20,593 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 06:20:20,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 06:20:20,600 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,600 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,611 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,611 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 06:20:20,633 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 06:20:20,634 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 06:20:20,634 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 06:20:20,635 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (1/1) ... [2021-12-17 06:20:20,641 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 06:20:20,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 06:20:20,673 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-17 06:20:20,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-17 06:20:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 06:20:20,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 06:20:20,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 06:20:20,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2021-12-17 06:20:20,779 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 06:20:20,780 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 06:20:20,919 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 06:20:20,923 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 06:20:20,923 INFO L301 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-17 06:20:20,924 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20 BoogieIcfgContainer [2021-12-17 06:20:20,924 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 06:20:20,926 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 06:20:20,926 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 06:20:20,928 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 06:20:20,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 06:20:20" (1/3) ... [2021-12-17 06:20:20,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b002974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 06:20:20" (2/3) ... [2021-12-17 06:20:20,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b002974 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 06:20:20, skipping insertion in model container [2021-12-17 06:20:20,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20" (3/3) ... [2021-12-17 06:20:20,930 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2021-12-17 06:20:20,934 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 06:20:20,934 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 06:20:20,987 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 06:20:20,992 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 06:20:20,992 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 06:20:21,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-12-17 06:20:21,005 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:21,005 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-12-17 06:20:21,005 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:21,019 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2021-12-17 06:20:21,030 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:21,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1194849079] [2021-12-17 06:20:21,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:21,041 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:21,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:21,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:21,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2021-12-17 06:20:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:21,161 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2021-12-17 06:20:21,164 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:21,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,242 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 06:20:21,243 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:20:21,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1194849079] [2021-12-17 06:20:21,244 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1194849079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 06:20:21,244 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 06:20:21,245 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 06:20:21,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900962086] [2021-12-17 06:20:21,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 06:20:21,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-17 06:20:21,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:20:21,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-17 06:20:21,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:21,282 INFO L87 Difference]: Start difference. First operand has 9 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 8 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:21,445 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2021-12-17 06:20:21,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-17 06:20:21,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2021-12-17 06:20:21,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:21,457 INFO L225 Difference]: With dead ends: 16 [2021-12-17 06:20:21,457 INFO L226 Difference]: Without dead ends: 7 [2021-12-17 06:20:21,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-17 06:20:21,464 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:21,465 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 06:20:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2021-12-17 06:20:21,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2021-12-17 06:20:21,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 6 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) [2021-12-17 06:20:21,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2021-12-17 06:20:21,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2021-12-17 06:20:21,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:21,489 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2021-12-17 06:20:21,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2021-12-17 06:20:21,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-12-17 06:20:21,490 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:21,490 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-12-17 06:20:21,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:21,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:20:21,702 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:21,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2021-12-17 06:20:21,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [97712577] [2021-12-17 06:20:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 06:20:21,704 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:21,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:21,707 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:21,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2021-12-17 06:20:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 06:20:21,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 06:20:21,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:21,829 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,830 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:21,874 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:21,874 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:20:21,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [97712577] [2021-12-17 06:20:21,875 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [97712577] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:21,875 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:20:21,875 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2021-12-17 06:20:21,875 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512564459] [2021-12-17 06:20:21,875 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:21,876 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-17 06:20:21,876 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:20:21,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-17 06:20:21,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-12-17 06:20:21,877 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:22,028 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2021-12-17 06:20:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-12-17 06:20:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2021-12-17 06:20:22,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:22,035 INFO L225 Difference]: With dead ends: 13 [2021-12-17 06:20:22,035 INFO L226 Difference]: Without dead ends: 10 [2021-12-17 06:20:22,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2021-12-17 06:20:22,037 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:22,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 06:20:22,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2021-12-17 06:20:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2021-12-17 06:20:22,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:22,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2021-12-17 06:20:22,042 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2021-12-17 06:20:22,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:22,043 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2021-12-17 06:20:22,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:22,043 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2021-12-17 06:20:22,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-12-17 06:20:22,043 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:22,044 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2021-12-17 06:20:22,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2021-12-17 06:20:22,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:20:22,252 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:22,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:22,252 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2021-12-17 06:20:22,253 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:22,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [692708718] [2021-12-17 06:20:22,253 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 06:20:22,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:22,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:22,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:22,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2021-12-17 06:20:22,394 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 06:20:22,394 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:20:22,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2021-12-17 06:20:22,403 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:20:22,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:22,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:20:22,586 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-17 06:20:22,587 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:20:22,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [692708718] [2021-12-17 06:20:22,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [692708718] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:20:22,587 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:20:22,587 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2021-12-17 06:20:22,587 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458515216] [2021-12-17 06:20:22,587 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:20:22,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-17 06:20:22,588 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:20:22,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-17 06:20:22,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2021-12-17 06:20:22,589 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand has 12 states, 12 states have (on average 1.25) 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) [2021-12-17 06:20:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:20:23,097 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2021-12-17 06:20:23,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-17 06:20:23,100 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.25) 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) Word has length 9 [2021-12-17 06:20:23,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:20:23,100 INFO L225 Difference]: With dead ends: 19 [2021-12-17 06:20:23,100 INFO L226 Difference]: Without dead ends: 16 [2021-12-17 06:20:23,101 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2021-12-17 06:20:23,102 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-17 06:20:23,102 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-17 06:20:23,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2021-12-17 06:20:23,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2021-12-17 06:20:23,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.0666666666666667) internal successors, (16), 15 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:20:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2021-12-17 06:20:23,107 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2021-12-17 06:20:23,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:20:23,107 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2021-12-17 06:20:23,107 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.25) 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) [2021-12-17 06:20:23,107 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2021-12-17 06:20:23,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-12-17 06:20:23,108 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:20:23,108 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2021-12-17 06:20:23,120 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2021-12-17 06:20:23,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:20:23,315 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:20:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:20:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2021-12-17 06:20:23,317 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:20:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [917012098] [2021-12-17 06:20:23,317 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 06:20:23,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:20:23,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:20:23,319 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:20:23,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2021-12-17 06:20:23,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-12-17 06:20:23,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:20:23,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2021-12-17 06:20:23,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:21:00,156 WARN L227 SmtUtils]: Spent 6.82s on a formula simplification that was a NOOP. DAG size: 21 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:21:27,539 WARN L227 SmtUtils]: Spent 7.95s on a formula simplification that was a NOOP. DAG size: 22 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2021-12-17 06:21:33,308 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0)))) is different from true [2021-12-17 06:21:33,371 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 40 refuted. 5 times theorem prover too weak. 0 trivial. 10 not checked. [2021-12-17 06:21:33,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:22:13,980 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:22:19,328 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:22:21,351 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:22:28,350 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:22:35,485 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:22:40,581 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:22:49,714 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:22:56,531 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:23:02,651 WARN L838 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from false [2021-12-17 06:23:04,692 WARN L860 $PredicateComparison]: unable to prove that (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) is different from true [2021-12-17 06:23:04,692 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 3 refuted. 3 times theorem prover too weak. 0 trivial. 49 not checked. [2021-12-17 06:23:04,693 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:23:04,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [917012098] [2021-12-17 06:23:04,693 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [917012098] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:23:04,693 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:23:04,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 27 [2021-12-17 06:23:04,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223532047] [2021-12-17 06:23:04,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:23:04,694 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2021-12-17 06:23:04,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:23:04,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2021-12-17 06:23:04,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=255, Unknown=19, NotChecked=378, Total=756 [2021-12-17 06:23:04,695 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:23:07,348 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:09,776 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (let ((.cse0 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0) .cse0))) ((_ to_fp 11 53) c_currentRoundingMode 1.0)))) is different from true [2021-12-17 06:23:11,824 WARN L860 $PredicateComparison]: unable to prove that (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= c_currentRoundingMode roundNearestTiesToEven) (= |c_ULTIMATE.start_main_~main__time~0#1| ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2021-12-17 06:23:29,537 WARN L860 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~main__time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2021-12-17 06:23:31,582 WARN L860 $PredicateComparison]: unable to prove that (and (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (= |c_ULTIMATE.start_main_~main__time~0#1| (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|) |c_ULTIMATE.start_main_~main__tick~0#1|)) (= |c_ULTIMATE.start_main_~main__tick~0#1| ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) is different from true [2021-12-17 06:23:40,036 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse2 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse0 (fp.add c_currentRoundingMode .cse2 |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse2) .cse1)) (= c_currentRoundingMode roundNearestTiesToEven) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (= |c_ULTIMATE.start_main_~main__time~0#1| (let ((.cse3 ((_ to_fp 8 24) c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))))) (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode (fp.add c_currentRoundingMode ((_ to_fp 8 24) c_currentRoundingMode (_ +zero 11 53)) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3) .cse3)))))) is different from true [2021-12-17 06:23:42,435 WARN L860 $PredicateComparison]: unable to prove that (let ((.cse0 (fp.add c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1| |c_ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 ((_ to_fp 11 53) c_currentRoundingMode 1.0))) (and (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode (fp.add c_currentRoundingMode .cse0 |c_ULTIMATE.start_main_~main__tick~0#1|)) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__time~0#1|) .cse1)) (not (fp.eq ((_ to_fp 11 53) c_currentRoundingMode .cse0) .cse1)))) is different from true [2021-12-17 06:23:53,105 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:55,121 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:57,284 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:23:59,864 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:02,157 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:11,778 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:14,211 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:16,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:18,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:26,212 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2021-12-17 06:24:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:24:26,377 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2021-12-17 06:24:26,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2021-12-17 06:24:26,378 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-12-17 06:24:26,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:24:26,378 INFO L225 Difference]: With dead ends: 26 [2021-12-17 06:24:26,378 INFO L226 Difference]: Without dead ends: 20 [2021-12-17 06:24:26,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 165.0s TimeCoverageRelationStatistics Valid=143, Invalid=353, Unknown=26, NotChecked=810, Total=1332 [2021-12-17 06:24:26,380 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 15 mSolverCounterUnsat, 10 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 30.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 10 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 30.5s IncrementalHoareTripleChecker+Time [2021-12-17 06:24:26,380 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 19 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 104 Invalid, 10 Unknown, 118 Unchecked, 30.5s Time] [2021-12-17 06:24:26,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2021-12-17 06:24:26,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2021-12-17 06:24:26,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.0526315789473684) internal successors, (20), 19 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:26,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2021-12-17 06:24:26,385 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2021-12-17 06:24:26,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:24:26,385 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2021-12-17 06:24:26,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:26,386 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2021-12-17 06:24:26,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 06:24:26,386 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 06:24:26,387 INFO L514 BasicCegarLoop]: trace histogram [14, 1, 1, 1, 1, 1] [2021-12-17 06:24:26,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2021-12-17 06:24:26,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:24:26,596 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 06:24:26,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 06:24:26,596 INFO L85 PathProgramCache]: Analyzing trace with hash 833592518, now seen corresponding path program 4 times [2021-12-17 06:24:26,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2021-12-17 06:24:26,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1123566023] [2021-12-17 06:24:26,597 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 06:24:26,597 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2021-12-17 06:24:26,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2021-12-17 06:24:26,598 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2021-12-17 06:24:26,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2021-12-17 06:24:26,856 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 06:24:26,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 06:24:26,876 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2021-12-17 06:24:26,877 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 06:24:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 44 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 06:24:27,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 06:24:28,588 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 44 proven. 55 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-12-17 06:24:28,589 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2021-12-17 06:24:28,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1123566023] [2021-12-17 06:24:28,589 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1123566023] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 06:24:28,589 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 06:24:28,589 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2021-12-17 06:24:28,589 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220688310] [2021-12-17 06:24:28,589 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 06:24:28,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 06:24:28,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2021-12-17 06:24:28,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 06:24:28,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-17 06:24:28,591 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:29,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 06:24:29,640 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2021-12-17 06:24:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-17 06:24:29,645 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-12-17 06:24:29,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 06:24:29,646 INFO L225 Difference]: With dead ends: 20 [2021-12-17 06:24:29,646 INFO L226 Difference]: Without dead ends: 0 [2021-12-17 06:24:29,646 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2021-12-17 06:24:29,647 INFO L933 BasicCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 15 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2021-12-17 06:24:29,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 15 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2021-12-17 06:24:29,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-12-17 06:24:29,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-12-17 06:24:29,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-12-17 06:24:29,649 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2021-12-17 06:24:29,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 06:24:29,649 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-12-17 06:24:29,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-12-17 06:24:29,649 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-12-17 06:24:29,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-12-17 06:24:29,652 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 06:24:29,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2021-12-17 06:24:29,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2021-12-17 06:24:29,858 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-12-17 06:33:11,606 WARN L227 SmtUtils]: Spent 8.70m on a formula simplification. DAG size of input: 118 DAG size of output: 109 (called from [L 149] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.combineInter) [2021-12-17 06:33:11,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-12-17 06:33:11,610 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-12-17 06:33:11,610 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-12-17 06:33:11,611 INFO L858 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2021-12-17 06:33:11,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-12-17 06:33:11,611 INFO L858 garLoopResultBuilder]: For program point L27(lines 27 35) no Hoare annotation was computed. [2021-12-17 06:33:11,611 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 29) no Hoare annotation was computed. [2021-12-17 06:33:11,611 INFO L854 garLoopResultBuilder]: At program point L18(lines 8 38) the Hoare annotation is: (let ((.cse12 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)))) (let ((.cse8 (fp.add currentRoundingMode .cse12 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse17 (fp.add currentRoundingMode .cse8 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse6 (fp.add currentRoundingMode .cse17 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse10 (fp.add currentRoundingMode |ULTIMATE.start_main_~main__time~0#1| |ULTIMATE.start_main_~main__tick~0#1|)) (.cse15 (fp.add currentRoundingMode .cse6 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse3 (fp.add currentRoundingMode .cse15 |ULTIMATE.start_main_~main__tick~0#1|)) (.cse9 (fp.add currentRoundingMode .cse10 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse11 (fp.add currentRoundingMode .cse9 |ULTIMATE.start_main_~main__tick~0#1|)) (.cse5 (fp.add currentRoundingMode .cse3 |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse13 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) (.cse7 (fp.add currentRoundingMode .cse5 |ULTIMATE.start_main_~main__tick~0#1|)) (.cse1 (fp.add currentRoundingMode (fp.add currentRoundingMode .cse11 |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|))) (let ((.cse14 (fp.add currentRoundingMode .cse1 |ULTIMATE.start_main_~main__tick~0#1|)) (.cse2 ((_ to_fp 11 53) currentRoundingMode 1.0)) (.cse0 (= currentRoundingMode roundNearestTiesToEven)) (.cse16 (fp.add currentRoundingMode .cse7 |ULTIMATE.start_main_~main__tick~0#1|)) (.cse4 (= |ULTIMATE.start_main_~main__tick~0#1| .cse13))) (or (and .cse0 (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse1) .cse2)) (= |ULTIMATE.start_main_~main__i~0#1| (_ bv5 32)) (= |ULTIMATE.start_main_~main__time~0#1| .cse3) .cse4) (and .cse0 .cse4 (= |ULTIMATE.start_main_~main__time~0#1| .cse5) (= |ULTIMATE.start_main_~main__i~0#1| (_ bv6 32))) (and (= |ULTIMATE.start_main_~main__i~0#1| (_ bv3 32)) .cse0 .cse4 (= |ULTIMATE.start_main_~main__time~0#1| .cse6)) (and .cse0 (= |ULTIMATE.start_main_~main__i~0#1| (_ bv7 32)) .cse4 (= |ULTIMATE.start_main_~main__time~0#1| .cse7)) (and .cse0 (= |ULTIMATE.start_main_~main__time~0#1| .cse8) (= |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) .cse4) (and (= |ULTIMATE.start_main_~main__i~0#1| (_ bv10 32)) (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse9) .cse2)) (not (fp.eq ((_ to_fp 11 53) currentRoundingMode |ULTIMATE.start_main_~main__time~0#1|) .cse2)) (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse10) .cse2)) .cse0 (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse11) .cse2)) (= |ULTIMATE.start_main_~main__time~0#1| (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode .cse12 .cse13) .cse13) .cse13) .cse13) .cse13) .cse13) .cse13) .cse13) .cse13) .cse13))) (and (not (fp.eq ((_ to_fp 11 53) currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode .cse14 |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|)) .cse2)) .cse0 (= |ULTIMATE.start_main_~main__time~0#1| .cse12) .cse4 (= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))) (and (= |ULTIMATE.start_main_~main__time~0#1| .cse15) .cse0 (not (fp.eq ((_ to_fp 11 53) currentRoundingMode .cse14) .cse2)) .cse4 (= |ULTIMATE.start_main_~main__i~0#1| (_ bv4 32))) (and .cse0 (= |ULTIMATE.start_main_~main__time~0#1| (fp.add currentRoundingMode .cse16 |ULTIMATE.start_main_~main__tick~0#1|)) .cse4 (= |ULTIMATE.start_main_~main__i~0#1| (_ bv9 32))) (and (= |ULTIMATE.start_main_~main__time~0#1| .cse17) (= |ULTIMATE.start_main_~main__i~0#1| (_ bv2 32)) .cse0 .cse4) (and (= |ULTIMATE.start_main_~main__i~0#1| (_ bv8 32)) .cse0 (= |ULTIMATE.start_main_~main__time~0#1| .cse16) .cse4))))))))))) [2021-12-17 06:33:11,612 INFO L861 garLoopResultBuilder]: At program point L34(lines 7 38) the Hoare annotation is: true [2021-12-17 06:33:11,614 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1] [2021-12-17 06:33:11,618 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 06:33:11,626 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,633 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,634 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,638 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,640 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,658 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,659 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,660 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,661 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,662 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,665 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 06:33:11 BoogieIcfgContainer [2021-12-17 06:33:11,680 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 06:33:11,681 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 06:33:11,681 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 06:33:11,682 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 06:33:11,682 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 06:20:20" (3/4) ... [2021-12-17 06:33:11,685 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-12-17 06:33:11,692 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2021-12-17 06:33:11,692 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2021-12-17 06:33:11,693 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-12-17 06:33:11,693 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-12-17 06:33:11,728 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 06:33:11,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 06:33:11,729 INFO L158 Benchmark]: Toolchain (without parser) took 771434.33ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.7MB in the beginning and 24.6MB in the end (delta: 2.1MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-12-17 06:33:11,731 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:11,731 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.37ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.4MB in the beginning and 43.7MB in the end (delta: -17.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. [2021-12-17 06:33:11,731 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.56ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:11,732 INFO L158 Benchmark]: Boogie Preprocessor took 39.11ms. Allocated memory is still 60.8MB. Free memory was 42.2MB in the beginning and 41.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 06:33:11,732 INFO L158 Benchmark]: RCFGBuilder took 291.41ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 33.1MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 06:33:11,732 INFO L158 Benchmark]: TraceAbstraction took 770754.70ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 28.7MB in the end (delta: 3.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2021-12-17 06:33:11,733 INFO L158 Benchmark]: Witness Printer took 47.54ms. Allocated memory is still 60.8MB. Free memory was 28.7MB in the beginning and 24.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-17 06:33:11,735 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25ms. Allocated memory is still 50.3MB. Free memory was 31.7MB in the beginning and 31.7MB in the end (delta: 50.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.37ms. Allocated memory was 50.3MB in the beginning and 60.8MB in the end (delta: 10.5MB). Free memory was 26.4MB in the beginning and 43.7MB in the end (delta: -17.3MB). Peak memory consumption was 7.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.56ms. Allocated memory is still 60.8MB. Free memory was 43.7MB in the beginning and 42.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 39.11ms. Allocated memory is still 60.8MB. Free memory was 42.2MB in the beginning and 41.2MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 291.41ms. Allocated memory is still 60.8MB. Free memory was 41.2MB in the beginning and 33.1MB in the end (delta: 8.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 770754.70ms. Allocated memory is still 60.8MB. Free memory was 32.6MB in the beginning and 28.7MB in the end (delta: 3.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Witness Printer took 47.54ms. Allocated memory is still 60.8MB. Free memory was 28.7MB in the beginning and 24.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * 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: 29]: 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, 9 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 770.6s, OverallIterations: 5, TraceHistogramMax: 14, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 83.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 521.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 10 mSolverCounterUnknown, 3 SdHoareTripleChecker+Valid, 32.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3 mSDsluCounter, 82 SdHoareTripleChecker+Invalid, 31.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 118 IncrementalHoareTripleChecker+Unchecked, 59 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 291 IncrementalHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 23 mSDtfsCounter, 291 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 31 SyntacticMatches, 4 SemanticMatches, 77 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 166.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred in iteration=4, InterpolantAutomatonStates: 55, 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, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 14 NumberOfFragments, 546 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 46 FormulaSimplificationTreeSizeReductionInter, 521.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 163.2s InterpolantComputationTime, 54 NumberOfCodeBlocks, 54 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 94 ConstructedInterpolants, 0 QuantifiedInterpolants, 900 SizeOfPredicates, 7 NumberOfNonLiveVariables, 207 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 100/342 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: 8]: Loop Invariant [2021-12-17 06:33:11,752 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,757 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,758 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,759 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,763 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,764 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2021-12-17 06:33:11,765 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((((((((((((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && main__i == 5bv32) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick)) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) || (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)) && main__i == 6bv32)) || (((main__i == 3bv32 && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick))) || (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && main__i == 7bv32) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick))) || (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick)) && main__i == 1bv32) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)))) || ((((((main__i == 10bv32 && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, main__time), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))))) || ((((!~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE())) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__i == 0bv32)) || ((((main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && !~fp.eq~DOUBLE(~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, main__time, main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)), ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0))) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__i == 4bv32)) || (((unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) && main__i == 9bv32)) || (((main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick) && main__i == 2bv32) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000)))) || (((main__i == 8bv32 && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && main__time == ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~fp.add~FLOAT(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~Pluszero~LONGDOUBLE()), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick), main__tick)) && main__tick == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 2500000037252903/25000000000000000))) - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2021-12-17 06:33:11,968 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