./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 -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/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-dev-03d7b7b [2022-02-20 16:21:17,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:17,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:17,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:17,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:17,055 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:17,057 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:17,060 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:17,062 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:17,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:17,067 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:17,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:17,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:17,071 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:17,072 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:17,073 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:17,074 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:17,075 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:17,077 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:17,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:17,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:17,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:17,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:17,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:17,090 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:17,092 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:17,092 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:17,093 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:17,094 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:17,095 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:17,095 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:17,096 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:17,097 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:17,098 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:17,099 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:17,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:17,100 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:17,100 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:17,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:17,101 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:17,103 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:17,103 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:21:17,134 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:17,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:17,135 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:17,135 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:17,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:17,136 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:17,137 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:17,137 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:17,137 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:17,138 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:17,138 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:17,139 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:21:17,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:17,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:17,139 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:17,139 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:17,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:17,140 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:17,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:17,140 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:17,140 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:17,140 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:17,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:17,141 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:17,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:17,141 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:17,141 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:17,143 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:17,143 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:21:17,143 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:21:17,143 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:17,143 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:17,144 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:17,144 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 [2022-02-20 16:21:17,354 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:17,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:17,379 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:17,380 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:17,381 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:17,382 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 [2022-02-20 16:21:17,443 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf907a00/185255cca64b402ea25f2596dbe6d127/FLAG609f89b94 [2022-02-20 16:21:17,802 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:17,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-02-20 16:21:17,812 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf907a00/185255cca64b402ea25f2596dbe6d127/FLAG609f89b94 [2022-02-20 16:21:18,227 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdf907a00/185255cca64b402ea25f2596dbe6d127 [2022-02-20 16:21:18,230 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:18,233 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:18,236 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:18,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:18,239 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:18,240 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f860f65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18, skipping insertion in model container [2022-02-20 16:21:18,242 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,249 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:18,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:18,393 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] [2022-02-20 16:21:18,400 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:18,410 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:18,421 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] [2022-02-20 16:21:18,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:18,434 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:18,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18 WrapperNode [2022-02-20 16:21:18,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:18,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:18,436 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:18,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:18,442 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,461 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 30 [2022-02-20 16:21:18,462 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:18,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:18,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:18,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:18,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,470 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,471 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,474 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,476 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,476 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,477 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:18,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:18,478 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:18,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:18,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (1/1) ... [2022-02-20 16:21:18,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:18,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:18,512 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:18,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:18,551 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:18,551 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:21:18,603 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:18,604 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:18,737 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:18,742 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:18,743 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:18,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:18 BoogieIcfgContainer [2022-02-20 16:21:18,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:18,746 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:18,746 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:18,750 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:18,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:18" (1/3) ... [2022-02-20 16:21:18,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614ec2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:18, skipping insertion in model container [2022-02-20 16:21:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:18" (2/3) ... [2022-02-20 16:21:18,752 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614ec2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:18, skipping insertion in model container [2022-02-20 16:21:18,752 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:18" (3/3) ... [2022-02-20 16:21:18,754 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-02-20 16:21:18,759 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:18,759 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:21:18,815 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:18,821 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:18,822 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:21:18,833 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) [2022-02-20 16:21:18,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 16:21:18,838 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:18,838 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 16:21:18,839 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:18,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:18,844 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-02-20 16:21:18,853 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:18,853 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305705584] [2022-02-20 16:21:18,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:18,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:18,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {12#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {12#true} is VALID [2022-02-20 16:21:19,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {12#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {14#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 16:21:19,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {14#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {13#false} is VALID [2022-02-20 16:21:19,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {13#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {13#false} is VALID [2022-02-20 16:21:19,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2022-02-20 16:21:19,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:19,058 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:19,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305705584] [2022-02-20 16:21:19,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305705584] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:19,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:19,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:21:19,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816363798] [2022-02-20 16:21:19,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:19,066 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 [2022-02-20 16:21:19,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:19,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:19,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:19,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:21:19,085 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:19,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:21:19,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:19,104 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) [2022-02-20 16:21:19,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,152 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:21:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:21:19,153 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 [2022-02-20 16:21:19,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:19,154 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:19,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 16:21:19,157 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 16:21:19,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-20 16:21:19,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:19,215 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:21:19,215 INFO L226 Difference]: Without dead ends: 7 [2022-02-20 16:21:19,217 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:19,223 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 [2022-02-20 16:21:19,224 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] [2022-02-20 16:21:19,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-02-20 16:21:19,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-20 16:21:19,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:19,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second 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) [2022-02-20 16:21:19,242 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second 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) [2022-02-20 16:21:19,243 INFO L87 Difference]: Start difference. First operand 7 states. Second 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) [2022-02-20 16:21:19,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,244 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 16:21:19,244 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:19,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:19,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:19,245 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 7 states. [2022-02-20 16:21:19,246 INFO L87 Difference]: Start difference. First 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) Second operand 7 states. [2022-02-20 16:21:19,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,247 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 16:21:19,247 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:19,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:19,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:19,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:19,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:19,248 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) [2022-02-20 16:21:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-02-20 16:21:19,250 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-02-20 16:21:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:19,251 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-02-20 16:21:19,251 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) [2022-02-20 16:21:19,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:21:19,252 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:19,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:21:19,252 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:21:19,253 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-02-20 16:21:19,254 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:19,254 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767129300] [2022-02-20 16:21:19,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:19,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:19,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {60#true} is VALID [2022-02-20 16:21:19,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {62#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 16:21:19,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {62#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {63#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} is VALID [2022-02-20 16:21:19,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {61#false} is VALID [2022-02-20 16:21:19,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {61#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {61#false} is VALID [2022-02-20 16:21:19,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-02-20 16:21:19,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:19,302 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:19,302 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767129300] [2022-02-20 16:21:19,302 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767129300] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:21:19,303 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916485068] [2022-02-20 16:21:19,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:19,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:21:19,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:19,307 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) [2022-02-20 16:21:19,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:21:19,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,363 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:21:19,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:19,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {60#true} is VALID [2022-02-20 16:21:19,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {70#(<= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 16:21:19,439 INFO L290 TraceCheckUtils]: 2: Hoare triple {70#(<= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {63#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} is VALID [2022-02-20 16:21:19,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {63#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {61#false} is VALID [2022-02-20 16:21:19,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {61#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {61#false} is VALID [2022-02-20 16:21:19,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-02-20 16:21:19,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:19,441 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:21:19,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {61#false} assume !false; {61#false} is VALID [2022-02-20 16:21:19,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {61#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {61#false} is VALID [2022-02-20 16:21:19,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {89#(< |ULTIMATE.start_main_~main__i~0#1| 10)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {61#false} is VALID [2022-02-20 16:21:19,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {93#(< |ULTIMATE.start_main_~main__i~0#1| 9)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {89#(< |ULTIMATE.start_main_~main__i~0#1| 10)} is VALID [2022-02-20 16:21:19,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {93#(< |ULTIMATE.start_main_~main__i~0#1| 9)} is VALID [2022-02-20 16:21:19,514 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {60#true} is VALID [2022-02-20 16:21:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:19,515 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916485068] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:21:19,516 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:21:19,516 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 16:21:19,517 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566759896] [2022-02-20 16:21:19,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:21:19,518 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 [2022-02-20 16:21:19,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:19,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:19,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:19,529 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:21:19,529 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:19,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:21:19,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:21:19,530 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) [2022-02-20 16:21:19,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,573 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:21:19,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:21:19,574 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 [2022-02-20 16:21:19,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:19,574 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:19,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-20 16:21:19,576 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-20 16:21:19,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-02-20 16:21:19,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:19,591 INFO L225 Difference]: With dead ends: 13 [2022-02-20 16:21:19,591 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:21:19,591 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 [2022-02-20 16:21:19,593 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:19,593 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:19,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:21:19,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:21:19,598 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:19,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:19,599 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:19,599 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,600 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:21:19,600 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:19,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:19,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:19,601 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:21:19,601 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:21:19,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:19,602 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:21:19,603 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:19,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:19,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:19,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:19,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:19,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:19,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:21:19,605 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-02-20 16:21:19,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:19,605 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:21:19,605 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) [2022-02-20 16:21:19,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:19,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:21:19,606 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:19,606 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-02-20 16:21:19,632 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:19,819 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 [2022-02-20 16:21:19,820 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:19,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-02-20 16:21:19,821 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:19,821 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035053872] [2022-02-20 16:21:19,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:19,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:19,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,923 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {152#true} is VALID [2022-02-20 16:21:19,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {154#(= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 16:21:19,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {155#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} is VALID [2022-02-20 16:21:19,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {156#(<= |ULTIMATE.start_main_~main__i~0#1| 2)} is VALID [2022-02-20 16:21:19,929 INFO L290 TraceCheckUtils]: 4: Hoare triple {156#(<= |ULTIMATE.start_main_~main__i~0#1| 2)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {157#(<= |ULTIMATE.start_main_~main__i~0#1| 3)} is VALID [2022-02-20 16:21:19,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(<= |ULTIMATE.start_main_~main__i~0#1| 3)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {158#(<= |ULTIMATE.start_main_~main__i~0#1| 4)} is VALID [2022-02-20 16:21:19,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(<= |ULTIMATE.start_main_~main__i~0#1| 4)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 16:21:19,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {153#false} is VALID [2022-02-20 16:21:19,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 16:21:19,932 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:19,932 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:19,932 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035053872] [2022-02-20 16:21:19,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035053872] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:21:19,935 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850806389] [2022-02-20 16:21:19,935 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:21:19,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:21:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:19,940 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) [2022-02-20 16:21:19,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:21:19,988 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:21:19,989 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:21:19,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:21:19,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:19,997 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:20,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {152#true} is VALID [2022-02-20 16:21:20,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {165#(<= |ULTIMATE.start_main_~main__i~0#1| 0)} is VALID [2022-02-20 16:21:20,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {165#(<= |ULTIMATE.start_main_~main__i~0#1| 0)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {155#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} is VALID [2022-02-20 16:21:20,123 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#(<= |ULTIMATE.start_main_~main__i~0#1| 1)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {156#(<= |ULTIMATE.start_main_~main__i~0#1| 2)} is VALID [2022-02-20 16:21:20,124 INFO L290 TraceCheckUtils]: 4: Hoare triple {156#(<= |ULTIMATE.start_main_~main__i~0#1| 2)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {157#(<= |ULTIMATE.start_main_~main__i~0#1| 3)} is VALID [2022-02-20 16:21:20,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {157#(<= |ULTIMATE.start_main_~main__i~0#1| 3)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {158#(<= |ULTIMATE.start_main_~main__i~0#1| 4)} is VALID [2022-02-20 16:21:20,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(<= |ULTIMATE.start_main_~main__i~0#1| 4)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 16:21:20,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {153#false} is VALID [2022-02-20 16:21:20,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 16:21:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:20,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:21:20,286 INFO L290 TraceCheckUtils]: 8: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-02-20 16:21:20,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {153#false} assume 0 == main_~__VERIFIER_assert__cond~0#1; {153#false} is VALID [2022-02-20 16:21:20,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {193#(< |ULTIMATE.start_main_~main__i~0#1| 10)} assume !(main_~main__i~0#1 < 10);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if ~someBinaryDOUBLEComparisonOperation(main_~main__time~0#1, 1.0) then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {153#false} is VALID [2022-02-20 16:21:20,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {197#(< |ULTIMATE.start_main_~main__i~0#1| 9)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {193#(< |ULTIMATE.start_main_~main__i~0#1| 10)} is VALID [2022-02-20 16:21:20,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {201#(< |ULTIMATE.start_main_~main__i~0#1| 8)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {197#(< |ULTIMATE.start_main_~main__i~0#1| 9)} is VALID [2022-02-20 16:21:20,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {205#(< |ULTIMATE.start_main_~main__i~0#1| 7)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {201#(< |ULTIMATE.start_main_~main__i~0#1| 8)} is VALID [2022-02-20 16:21:20,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {209#(< |ULTIMATE.start_main_~main__i~0#1| 6)} assume main_~main__i~0#1 < 10;main_~main__time~0#1 := ~someBinaryArithmeticFLOAToperation(main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := 1 + main_~main__i~0#1; {205#(< |ULTIMATE.start_main_~main__i~0#1| 7)} is VALID [2022-02-20 16:21:20,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := 0.10000000149011612;main_~main__time~0#1 := 0.0;havoc main_~main__i~0#1;main_~main__i~0#1 := 0; {209#(< |ULTIMATE.start_main_~main__i~0#1| 6)} is VALID [2022-02-20 16:21:20,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(30, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0; {152#true} is VALID [2022-02-20 16:21:20,292 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:20,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [850806389] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:21:20,293 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:21:20,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 16:21:20,293 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665923291] [2022-02-20 16:21:20,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:21:20,294 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 [2022-02-20 16:21:20,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:20,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:20,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:20,311 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:21:20,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:20,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:21:20,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 16:21:20,312 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) [2022-02-20 16:21:20,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:20,378 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 16:21:20,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:21:20,379 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 [2022-02-20 16:21:20,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:20,380 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:20,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-02-20 16:21:20,383 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-02-20 16:21:20,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-02-20 16:21:20,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:20,405 INFO L225 Difference]: With dead ends: 19 [2022-02-20 16:21:20,405 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:21:20,405 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 [2022-02-20 16:21:20,406 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:20,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:20,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:21:20,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:21:20,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:20,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second 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) [2022-02-20 16:21:20,418 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second 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) [2022-02-20 16:21:20,418 INFO L87 Difference]: Start difference. First operand 16 states. Second 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) [2022-02-20 16:21:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:20,419 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:21:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:20,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:20,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:20,420 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 16 states. [2022-02-20 16:21:20,420 INFO L87 Difference]: Start difference. First 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) Second operand 16 states. [2022-02-20 16:21:20,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:20,422 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:21:20,422 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:20,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:20,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:20,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:20,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:20,423 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) [2022-02-20 16:21:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 16:21:20,424 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-02-20 16:21:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:20,424 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 16:21:20,424 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) [2022-02-20 16:21:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:21:20,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:20,426 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-02-20 16:21:20,453 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:20,642 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 [2022-02-20 16:21:20,643 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:20,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-02-20 16:21:20,643 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:20,644 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321176923] [2022-02-20 16:21:20,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:20,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:20,677 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:21:20,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:20,705 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:21:20,706 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:21:20,707 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:21:20,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:21:20,711 INFO L732 BasicCegarLoop]: Path program histogram: [3, 1] [2022-02-20 16:21:20,714 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:21:20,734 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:21:20,735 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:21:20,735 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:21:20,735 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2022-02-20 16:21:20,735 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:20,735 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:20,736 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:21:20,736 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-02-20 16:21:20,736 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 16:21:20,736 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:21:20,736 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:21:20,737 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:21:20 BoogieIcfgContainer [2022-02-20 16:21:20,737 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:21:20,737 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:21:20,737 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:21:20,738 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:21:20,738 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:18" (3/4) ... [2022-02-20 16:21:20,740 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:21:20,741 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:21:20,742 INFO L158 Benchmark]: Toolchain (without parser) took 2508.99ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.9MB in the beginning and 77.1MB in the end (delta: -25.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:20,742 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:20,743 INFO L158 Benchmark]: CACSL2BoogieTranslator took 198.51ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 81.3MB in the end (delta: -29.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:20,743 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.74ms. Allocated memory is still 104.9MB. Free memory was 81.3MB in the beginning and 79.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:20,743 INFO L158 Benchmark]: Boogie Preprocessor took 14.88ms. Allocated memory is still 104.9MB. Free memory was 79.9MB in the beginning and 78.9MB in the end (delta: 958.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:20,744 INFO L158 Benchmark]: RCFGBuilder took 266.69ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 70.0MB in the end (delta: 8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:20,744 INFO L158 Benchmark]: TraceAbstraction took 1990.61ms. Allocated memory is still 104.9MB. Free memory was 69.7MB in the beginning and 77.8MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:20,744 INFO L158 Benchmark]: Witness Printer took 3.53ms. Allocated memory is still 104.9MB. Free memory was 77.8MB in the beginning and 77.1MB in the end (delta: 705.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:20,746 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 86.0MB. Free memory was 56.1MB in the beginning and 56.1MB in the end (delta: 24.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 198.51ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.6MB in the beginning and 81.3MB in the end (delta: -29.6MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.74ms. Allocated memory is still 104.9MB. Free memory was 81.3MB in the beginning and 79.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.88ms. Allocated memory is still 104.9MB. Free memory was 79.9MB in the beginning and 78.9MB in the end (delta: 958.0kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 266.69ms. Allocated memory is still 104.9MB. Free memory was 78.7MB in the beginning and 70.0MB in the end (delta: 8.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1990.61ms. Allocated memory is still 104.9MB. Free memory was 69.7MB in the beginning and 77.8MB in the end (delta: -8.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.53ms. Allocated memory is still 104.9MB. Free memory was 77.8MB in the beginning and 77.1MB in the end (delta: 705.2kB). 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.9s, OverallIterations: 4, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, 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, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 25 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 18 mSDtfsCounter, 25 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.7s 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 [2022-02-20 16:21:20,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/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-dev-03d7b7b [2022-02-20 16:21:22,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:22,745 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:22,769 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:22,769 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:22,772 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:22,774 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:22,775 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:22,776 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:22,777 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:22,778 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:22,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:22,783 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:22,784 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:22,785 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:22,786 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:22,787 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:22,789 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:22,790 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:22,794 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:22,797 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:22,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:22,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:22,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:22,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:22,807 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:22,808 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:22,808 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:22,809 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:22,810 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:22,810 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:22,811 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:22,812 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:22,814 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:22,815 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:22,816 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:22,817 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:22,817 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:22,817 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:22,818 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:22,819 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:22,822 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:21:22,847 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:22,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:22,848 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:22,848 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:22,849 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:22,849 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:22,851 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:22,851 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:22,851 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:22,851 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:22,852 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:22,852 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:22,853 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:22,853 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:22,853 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:22,853 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:22,853 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:22,854 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:22,855 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:22,855 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:22,855 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:22,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:22,856 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:22,856 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:22,856 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:22,856 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:21:22,856 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:21:22,857 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:22,857 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:22,857 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:22,857 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:21:22,858 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 [2022-02-20 16:21:23,152 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:23,177 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:23,180 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:23,181 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:23,181 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:23,183 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 [2022-02-20 16:21:23,247 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a4c20e5/6d7433e16ed8440ab3a212920f13870b/FLAGf369dcb5c [2022-02-20 16:21:23,660 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:23,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/drift_tenth.c.p+cfa-reducer.c [2022-02-20 16:21:23,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a4c20e5/6d7433e16ed8440ab3a212920f13870b/FLAGf369dcb5c [2022-02-20 16:21:24,077 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a1a4c20e5/6d7433e16ed8440ab3a212920f13870b [2022-02-20 16:21:24,080 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:24,081 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:24,084 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:24,084 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:24,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:24,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cfe54dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24, skipping insertion in model container [2022-02-20 16:21:24,090 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,097 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:24,110 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:24,218 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] [2022-02-20 16:21:24,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:24,233 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:24,246 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] [2022-02-20 16:21:24,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:24,263 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:24,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24 WrapperNode [2022-02-20 16:21:24,264 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:24,265 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:24,265 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:24,265 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:24,271 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,278 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,310 INFO L137 Inliner]: procedures = 13, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 31 [2022-02-20 16:21:24,311 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:24,312 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:24,312 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:24,312 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:24,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,331 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,332 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,345 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,353 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,356 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:24,358 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:24,359 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:24,359 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:24,361 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (1/1) ... [2022-02-20 16:21:24,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:24,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:24,393 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:21:24,414 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:21:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:24,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:24,431 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:21:24,504 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:24,505 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:24,715 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:24,720 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:24,721 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:24,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:24 BoogieIcfgContainer [2022-02-20 16:21:24,722 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:24,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:24,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:24,736 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:24,736 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:24" (1/3) ... [2022-02-20 16:21:24,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ab3682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:24, skipping insertion in model container [2022-02-20 16:21:24,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:24" (2/3) ... [2022-02-20 16:21:24,737 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24ab3682 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:24, skipping insertion in model container [2022-02-20 16:21:24,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:24" (3/3) ... [2022-02-20 16:21:24,738 INFO L111 eAbstractionObserver]: Analyzing ICFG drift_tenth.c.p+cfa-reducer.c [2022-02-20 16:21:24,750 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:24,753 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:21:24,824 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:24,830 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:24,830 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:21:24,861 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) [2022-02-20 16:21:24,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 16:21:24,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:24,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 16:21:24,872 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 28696774, now seen corresponding path program 1 times [2022-02-20 16:21:24,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:24,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [333155171] [2022-02-20 16:21:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:24,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:24,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:24,898 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:24,905 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:21:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:25,010 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:21:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:25,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:25,109 INFO L290 TraceCheckUtils]: 0: Hoare triple {12#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {12#true} is VALID [2022-02-20 16:21:25,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {12#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {20#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:21:25,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {20#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {13#false} is VALID [2022-02-20 16:21:25,118 INFO L290 TraceCheckUtils]: 3: Hoare triple {13#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {13#false} is VALID [2022-02-20 16:21:25,118 INFO L290 TraceCheckUtils]: 4: Hoare triple {13#false} assume !false; {13#false} is VALID [2022-02-20 16:21:25,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:25,120 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:21:25,120 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:25,120 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [333155171] [2022-02-20 16:21:25,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [333155171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:25,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:25,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:21:25,125 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126135010] [2022-02-20 16:21:25,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:25,130 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 [2022-02-20 16:21:25,131 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:25,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:25,169 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:25,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:21:25,170 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:25,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:21:25,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:21:25,194 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) [2022-02-20 16:21:25,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:25,570 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2022-02-20 16:21:25,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:21:25,571 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 [2022-02-20 16:21:25,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:25,572 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:25,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 16:21:25,581 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:25,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 18 transitions. [2022-02-20 16:21:25,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 18 transitions. [2022-02-20 16:21:25,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:25,652 INFO L225 Difference]: With dead ends: 16 [2022-02-20 16:21:25,653 INFO L226 Difference]: Without dead ends: 7 [2022-02-20 16:21:25,655 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 [2022-02-20 16:21:25,658 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:25,659 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.2s Time] [2022-02-20 16:21:25,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2022-02-20 16:21:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2022-02-20 16:21:25,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:25,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second 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) [2022-02-20 16:21:25,686 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second 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) [2022-02-20 16:21:25,686 INFO L87 Difference]: Start difference. First operand 7 states. Second 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) [2022-02-20 16:21:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:25,687 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 16:21:25,687 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:25,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:25,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:25,688 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 7 states. [2022-02-20 16:21:25,688 INFO L87 Difference]: Start difference. First 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) Second operand 7 states. [2022-02-20 16:21:25,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:25,689 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2022-02-20 16:21:25,689 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:25,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:25,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:25,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:25,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:25,690 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) [2022-02-20 16:21:25,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2022-02-20 16:21:25,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2022-02-20 16:21:25,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:25,693 INFO L470 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2022-02-20 16:21:25,693 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) [2022-02-20 16:21:25,693 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2022-02-20 16:21:25,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:21:25,694 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:25,694 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:21:25,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:25,905 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:21:25,905 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:25,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:25,906 INFO L85 PathProgramCache]: Analyzing trace with hash 889537510, now seen corresponding path program 1 times [2022-02-20 16:21:25,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:25,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208075414] [2022-02-20 16:21:25,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:25,908 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:25,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:25,910 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:25,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:21:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:25,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:21:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:25,995 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:26,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {72#true} is VALID [2022-02-20 16:21:26,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {80#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:21:26,066 INFO L290 TraceCheckUtils]: 2: Hoare triple {80#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {84#(= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 16:21:26,066 INFO L290 TraceCheckUtils]: 3: Hoare triple {84#(= (_ bv0 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {73#false} is VALID [2022-02-20 16:21:26,067 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {73#false} is VALID [2022-02-20 16:21:26,067 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#false} assume !false; {73#false} is VALID [2022-02-20 16:21:26,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:26,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:21:26,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {73#false} assume !false; {73#false} is VALID [2022-02-20 16:21:26,155 INFO L290 TraceCheckUtils]: 4: Hoare triple {73#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {73#false} is VALID [2022-02-20 16:21:26,155 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#(bvslt |ULTIMATE.start_main_~main__i~0#1| (_ bv10 32))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {73#false} is VALID [2022-02-20 16:21:26,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#(bvslt (bvadd |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (_ bv10 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {100#(bvslt |ULTIMATE.start_main_~main__i~0#1| (_ bv10 32))} is VALID [2022-02-20 16:21:26,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {72#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {104#(bvslt (bvadd |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-20 16:21:26,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {72#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {72#true} is VALID [2022-02-20 16:21:26,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:26,171 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:26,171 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208075414] [2022-02-20 16:21:26,171 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208075414] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:21:26,172 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:21:26,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 16:21:26,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092048685] [2022-02-20 16:21:26,172 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:21:26,177 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 [2022-02-20 16:21:26,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:26,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:26,237 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:26,238 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:21:26,238 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:26,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:21:26,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:21:26,239 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) [2022-02-20 16:21:26,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:26,972 INFO L93 Difference]: Finished difference Result 13 states and 15 transitions. [2022-02-20 16:21:26,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:21:26,972 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 [2022-02-20 16:21:26,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:26,972 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:26,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-20 16:21:26,973 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:26,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2022-02-20 16:21:26,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 15 transitions. [2022-02-20 16:21:27,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:27,110 INFO L225 Difference]: With dead ends: 13 [2022-02-20 16:21:27,110 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 16:21:27,111 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:21:27,112 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:27,112 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.4s Time] [2022-02-20 16:21:27,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 16:21:27,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2022-02-20 16:21:27,116 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:27,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:27,117 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:27,117 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:27,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:27,118 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:21:27,118 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:27,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:27,119 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:27,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:21:27,119 INFO L87 Difference]: Start difference. First operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 10 states. [2022-02-20 16:21:27,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:27,120 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 16:21:27,120 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:27,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:27,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:27,121 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:27,121 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:27,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:21:27,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2022-02-20 16:21:27,123 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 6 [2022-02-20 16:21:27,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:27,123 INFO L470 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2022-02-20 16:21:27,123 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) [2022-02-20 16:21:27,123 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 16:21:27,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 16:21:27,124 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:27,124 INFO L514 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1] [2022-02-20 16:21:27,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:27,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:21:27,336 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:27,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:27,337 INFO L85 PathProgramCache]: Analyzing trace with hash 201697478, now seen corresponding path program 2 times [2022-02-20 16:21:27,337 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:27,337 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784431597] [2022-02-20 16:21:27,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:21:27,338 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:27,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:27,339 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:27,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:21:27,462 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 16:21:27,463 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:21:27,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 16:21:27,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:27,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:21:27,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {165#true} is VALID [2022-02-20 16:21:27,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {173#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} is VALID [2022-02-20 16:21:27,569 INFO L290 TraceCheckUtils]: 2: Hoare triple {173#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv0 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {177#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32))} is VALID [2022-02-20 16:21:27,570 INFO L290 TraceCheckUtils]: 3: Hoare triple {177#(= |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {181#(= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 16:21:27,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {181#(= (_ bv1 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {185#(= (_ bv3 32) |ULTIMATE.start_main_~main__i~0#1|)} is VALID [2022-02-20 16:21:27,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {185#(= (_ bv3 32) |ULTIMATE.start_main_~main__i~0#1|)} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {189#(= (_ bv3 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} is VALID [2022-02-20 16:21:27,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {189#(= (_ bv3 32) (bvadd (_ bv4294967295 32) |ULTIMATE.start_main_~main__i~0#1|))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {166#false} is VALID [2022-02-20 16:21:27,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {166#false} is VALID [2022-02-20 16:21:27,573 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 16:21:27,573 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:27,574 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:21:27,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 16:21:27,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {166#false} is VALID [2022-02-20 16:21:27,718 INFO L290 TraceCheckUtils]: 6: Hoare triple {205#(bvslt |ULTIMATE.start_main_~main__i~0#1| (_ bv10 32))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {166#false} is VALID [2022-02-20 16:21:27,731 INFO L290 TraceCheckUtils]: 5: Hoare triple {209#(bvslt (bvadd |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (_ bv10 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {205#(bvslt |ULTIMATE.start_main_~main__i~0#1| (_ bv10 32))} is VALID [2022-02-20 16:21:27,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {213#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {209#(bvslt (bvadd |ULTIMATE.start_main_~main__i~0#1| (_ bv1 32)) (_ bv10 32))} is VALID [2022-02-20 16:21:27,760 INFO L290 TraceCheckUtils]: 3: Hoare triple {217#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {213#(bvslt (bvadd (_ bv2 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} is VALID [2022-02-20 16:21:27,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {221#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {217#(bvslt (bvadd (_ bv3 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} is VALID [2022-02-20 16:21:27,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {221#(bvslt (bvadd (_ bv4 32) |ULTIMATE.start_main_~main__i~0#1|) (_ bv10 32))} is VALID [2022-02-20 16:21:27,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {165#true} is VALID [2022-02-20 16:21:27,776 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:27,776 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:21:27,777 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784431597] [2022-02-20 16:21:27,777 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784431597] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:21:27,777 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:21:27,777 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-02-20 16:21:27,777 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968473816] [2022-02-20 16:21:27,777 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:21:27,778 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 [2022-02-20 16:21:27,778 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:27,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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) [2022-02-20 16:21:27,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:27,870 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:21:27,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:21:27,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:21:27,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:21:27,872 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) [2022-02-20 16:21:30,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:30,709 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 16:21:30,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 16:21:30,709 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 [2022-02-20 16:21:30,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:30,710 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:30,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-02-20 16:21:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 16:21:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 24 transitions. [2022-02-20 16:21:30,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 24 transitions. [2022-02-20 16:21:30,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:30,878 INFO L225 Difference]: With dead ends: 19 [2022-02-20 16:21:30,878 INFO L226 Difference]: Without dead ends: 16 [2022-02-20 16:21:30,879 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 [2022-02-20 16:21:30,880 INFO L933 BasicCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:30,880 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-02-20 16:21:30,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-02-20 16:21:30,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-02-20 16:21:30,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:30,885 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second 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) [2022-02-20 16:21:30,885 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second 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) [2022-02-20 16:21:30,885 INFO L87 Difference]: Start difference. First operand 16 states. Second 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) [2022-02-20 16:21:30,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:30,886 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:21:30,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:30,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:30,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:30,887 INFO L74 IsIncluded]: Start isIncluded. First 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) Second operand 16 states. [2022-02-20 16:21:30,888 INFO L87 Difference]: Start difference. First 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) Second operand 16 states. [2022-02-20 16:21:30,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:30,889 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-02-20 16:21:30,889 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:30,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:30,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:30,890 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:30,890 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:30,890 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) [2022-02-20 16:21:30,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2022-02-20 16:21:30,891 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 9 [2022-02-20 16:21:30,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:30,891 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2022-02-20 16:21:30,892 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) [2022-02-20 16:21:30,894 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-02-20 16:21:30,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:21:30,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:30,895 INFO L514 BasicCegarLoop]: trace histogram [10, 1, 1, 1, 1, 1] [2022-02-20 16:21:30,905 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:21:31,095 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:21:31,096 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:31,097 INFO L85 PathProgramCache]: Analyzing trace with hash -763767610, now seen corresponding path program 3 times [2022-02-20 16:21:31,097 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:21:31,097 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323558111] [2022-02-20 16:21:31,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 16:21:31,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:21:31,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:21:31,099 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:21:31,101 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:21:31,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-02-20 16:21:31,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:21:31,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 16:21:31,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:31,392 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:24,771 WARN L228 SmtUtils]: Spent 5.18s 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) [2022-02-20 16:22:30,816 WARN L860 $PredicateComparison]: unable to prove that (and (= |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))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from true [2022-02-20 16:22:30,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {324#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(30bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32; {329#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:30,922 INFO L290 TraceCheckUtils]: 1: Hoare triple {329#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main__tick~0#1, main_~main__time~0#1, main_~main__i~0#1;main_~main__tick~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.10000000149011612));main_~main__time~0#1 := ~convertDOUBLEToFLOAT(currentRoundingMode, ~Pluszero~DOUBLE());havoc main_~main__i~0#1;main_~main__i~0#1 := 0bv32; {333#(and (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {333#(and (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {337#(and (= (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {337#(and (= (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {341#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {341#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {345#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {345#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {349#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven) (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__time~0#1|))} is VALID [2022-02-20 16:22:30,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {349#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven) (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__time~0#1|))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {353#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {353#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {357#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= |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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,929 INFO L290 TraceCheckUtils]: 8: Hoare triple {357#(and (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= |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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |ULTIMATE.start_main_~main__tick~0#1|) |ULTIMATE.start_main_~main__tick~0#1|)) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {361#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {365#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {365#(and (= (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode (fp.add currentRoundingMode ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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|) |ULTIMATE.start_main_~main__time~0#1|) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {369#(and (= |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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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|) |ULTIMATE.start_main_~main__tick~0#1|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:30,932 INFO L290 TraceCheckUtils]: 11: Hoare triple {369#(and (= |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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |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|) |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|) |ULTIMATE.start_main_~main__tick~0#1|)) (= ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0))) |ULTIMATE.start_main_~main__tick~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvslt32(main_~main__i~0#1, 10bv32);main_~main__time~0#1 := ~fp.add~FLOAT(currentRoundingMode, main_~main__time~0#1, main_~main__tick~0#1);main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {373#(and (= currentRoundingMode roundNearestTiesToEven) (= (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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) |ULTIMATE.start_main_~main__time~0#1|))} is VALID [2022-02-20 16:22:30,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {373#(and (= currentRoundingMode roundNearestTiesToEven) (= (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 ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 2500000037252903.0 25000000000000000.0)))) |ULTIMATE.start_main_~main__time~0#1|))} assume !~bvslt32(main_~main__i~0#1, 10bv32);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if !~fp.eq~DOUBLE(~convertFLOATToDOUBLE(currentRoundingMode, main_~main__time~0#1), ~to_fp~DOUBLE(currentRoundingMode, 1.0)) then 1bv32 else 0bv32);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {377#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:22:30,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {325#false} is VALID [2022-02-20 16:22:30,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {325#false} assume !false; {325#false} is VALID [2022-02-20 16:22:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 44 refuted. 1 times theorem prover too weak. 0 trivial. 10 not checked. [2022-02-20 16:22:30,934 INFO L328 TraceCheckSpWp]: Computing backward predicates...