./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/phases_1-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loop-acceleration/phases_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e01e17e388e5f82fac906dfd87d9bb3456f878f ..................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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/loop-acceleration/phases_1-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4e01e17e388e5f82fac906dfd87d9bb3456f878f ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:47,216 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:47,218 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:47,231 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:47,231 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:47,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:47,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:47,236 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:47,238 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:47,239 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:47,240 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:47,241 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:47,242 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:47,243 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:47,244 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:47,245 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:47,246 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:47,247 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:47,249 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:47,252 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:47,254 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:47,255 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:47,256 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:47,257 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:47,261 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:47,261 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:47,261 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:47,266 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:47,266 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:47,267 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:47,268 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:47,272 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:47,273 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:47,275 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:47,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:47,280 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:47,281 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:47,282 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:47,282 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:47,283 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:47,284 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:47,286 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:13:47,313 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:47,314 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:47,315 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:47,316 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:47,316 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:47,316 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:47,316 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:47,317 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:13:47,317 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:47,317 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:47,318 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:47,318 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:47,318 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:47,318 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:47,319 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:47,319 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:47,319 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:47,320 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:47,320 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:47,320 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:47,320 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:47,321 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:47,321 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:47,321 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:47,322 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:47,322 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:13:47,322 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:13:47,322 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:47,323 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:47,323 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 4e01e17e388e5f82fac906dfd87d9bb3456f878f [2020-07-28 18:13:47,629 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:47,642 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:47,645 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:47,647 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:47,647 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:47,648 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2020-07-28 18:13:47,710 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe33149bf/7854cb92eddc4253a601e5a237fc0516/FLAGf94f2de4c [2020-07-28 18:13:48,142 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:48,143 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2020-07-28 18:13:48,150 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe33149bf/7854cb92eddc4253a601e5a237fc0516/FLAGf94f2de4c [2020-07-28 18:13:48,547 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fe33149bf/7854cb92eddc4253a601e5a237fc0516 [2020-07-28 18:13:48,550 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:48,553 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:48,554 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:48,554 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:48,558 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:48,559 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,562 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6f491f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48, skipping insertion in model container [2020-07-28 18:13:48,562 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,569 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:48,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:48,755 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:48,759 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:48,774 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:48,789 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:48,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48 WrapperNode [2020-07-28 18:13:48,789 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:48,790 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:48,791 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:48,791 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:48,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,804 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,882 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:48,883 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:48,883 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:48,883 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:48,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,896 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,901 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,902 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... [2020-07-28 18:13:48,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:48,903 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:48,903 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:48,904 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:48,905 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:48,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:48,978 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:49,176 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:49,176 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:13:49,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:49 BoogieIcfgContainer [2020-07-28 18:13:49,180 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:49,181 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:49,181 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:49,184 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:49,185 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:48" (1/3) ... [2020-07-28 18:13:49,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a524a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:49, skipping insertion in model container [2020-07-28 18:13:49,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:48" (2/3) ... [2020-07-28 18:13:49,186 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78a524a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:49, skipping insertion in model container [2020-07-28 18:13:49,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:49" (3/3) ... [2020-07-28 18:13:49,188 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2020-07-28 18:13:49,199 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:49,206 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:49,221 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:49,275 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:49,278 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:49,279 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:49,279 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:49,279 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:49,279 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:49,279 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:49,280 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:49,320 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-07-28 18:13:49,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:49,330 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:49,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:49,331 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:49,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:49,348 INFO L82 PathProgramCache]: Analyzing trace with hash 30108868, now seen corresponding path program 1 times [2020-07-28 18:13:49,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:13:49,358 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220683282] [2020-07-28 18:13:49,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:13:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:49,456 INFO L280 TraceCheckUtils]: 0: Hoare triple {13#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0; {13#true} is VALID [2020-07-28 18:13:49,457 INFO L280 TraceCheckUtils]: 1: Hoare triple {13#true} assume !true; {14#false} is VALID [2020-07-28 18:13:49,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {14#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~x~0 % 4294967296 < 0 && 0 != main_~x~0 % 4294967296 % 2 then main_~x~0 % 4294967296 % 2 - 2 else main_~x~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14#false} is VALID [2020-07-28 18:13:49,458 INFO L280 TraceCheckUtils]: 3: Hoare triple {14#false} assume 0 == __VERIFIER_assert_~cond; {14#false} is VALID [2020-07-28 18:13:49,458 INFO L280 TraceCheckUtils]: 4: Hoare triple {14#false} assume !false; {14#false} is VALID [2020-07-28 18:13:49,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:49,461 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220683282] [2020-07-28 18:13:49,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:49,463 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:13:49,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272994134] [2020-07-28 18:13:49,470 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:49,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:49,475 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:13:49,515 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:49,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:13:49,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:13:49,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:13:49,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:49,528 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 2 states. [2020-07-28 18:13:49,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:49,566 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-28 18:13:49,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:13:49,566 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:49,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:49,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:49,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2020-07-28 18:13:49,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:49,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2020-07-28 18:13:49,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 20 transitions. [2020-07-28 18:13:49,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:49,629 INFO L225 Difference]: With dead ends: 17 [2020-07-28 18:13:49,630 INFO L226 Difference]: Without dead ends: 7 [2020-07-28 18:13:49,634 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:49,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-07-28 18:13:49,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-28 18:13:49,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:49,662 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:49,663 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:49,663 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:49,665 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-28 18:13:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:49,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:49,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:49,666 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:49,666 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:49,668 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-28 18:13:49,668 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:49,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:49,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:49,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:49,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:49,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:13:49,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-28 18:13:49,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2020-07-28 18:13:49,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:49,672 INFO L479 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-28 18:13:49,673 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:13:49,673 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:49,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:49,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:49,673 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:49,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:13:49,674 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:49,675 INFO L82 PathProgramCache]: Analyzing trace with hash 29810958, now seen corresponding path program 1 times [2020-07-28 18:13:49,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:13:49,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319814316] [2020-07-28 18:13:49,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:13:49,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:49,718 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:13:49,719 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) at de.uni_freiburg.informatik.ultimate.smtinterpol.proof.ProofTermGenerator.convert(ProofTermGenerator.java:150) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getProof(SMTInterpol.java:797) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:392) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:386) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:191) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:166) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:326) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:228) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:242) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:75) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:508) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:436) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:370) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-28 18:13:49,725 INFO L168 Benchmark]: Toolchain (without parser) took 1172.19 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -125.3 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,725 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:49,726 INFO L168 Benchmark]: CACSL2BoogieTranslator took 235.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,727 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,728 INFO L168 Benchmark]: Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,729 INFO L168 Benchmark]: RCFGBuilder took 276.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,730 INFO L168 Benchmark]: TraceAbstraction took 540.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:49,735 INFO L336 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 235.63 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 946.8 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 946.8 MB in the beginning and 1.1 GB in the end (delta: -193.3 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.93 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 276.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 17.6 MB). Peak memory consumption was 17.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 540.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 33.0 MB). Peak memory consumption was 33.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.proof.FixResolutionProof.fix(FixResolutionProof.java:191) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:13:51,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:13:51,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:13:51,667 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:13:51,668 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:13:51,669 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:13:51,670 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:13:51,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:13:51,674 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:13:51,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:13:51,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:13:51,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:13:51,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:13:51,679 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:13:51,680 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:13:51,681 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:13:51,682 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:13:51,683 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:13:51,685 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:13:51,687 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:13:51,688 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:13:51,689 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:13:51,691 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:13:51,691 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:13:51,694 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:13:51,694 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:13:51,695 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:13:51,696 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:13:51,696 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:13:51,697 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:13:51,697 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:13:51,698 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:13:51,699 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:13:51,700 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:13:51,701 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:13:51,701 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:13:51,702 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:13:51,702 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:13:51,702 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:13:51,703 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:13:51,704 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:13:51,705 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2020-07-28 18:13:51,720 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:13:51,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:13:51,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:13:51,722 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:13:51,722 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:13:51,723 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:13:51,723 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:13:51,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:13:51,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:13:51,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:13:51,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:13:51,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:13:51,724 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:13:51,724 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:13:51,725 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:13:51,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:13:51,725 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:13:51,725 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:13:51,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:13:51,726 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:13:51,726 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:13:51,726 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:13:51,726 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:51,727 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:13:51,727 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:13:51,727 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:13:51,727 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:13:51,727 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:13:51,728 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:13:51,728 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:13:51,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:13:51,728 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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(__VERIFIER_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 -> 4e01e17e388e5f82fac906dfd87d9bb3456f878f [2020-07-28 18:13:52,039 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:13:52,054 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:13:52,058 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:13:52,059 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:13:52,060 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:13:52,060 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/phases_1-1.c [2020-07-28 18:13:52,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40334d3cb/0ef25abdbbc84480aac5e30be4d94b62/FLAGa1c47a5d9 [2020-07-28 18:13:52,563 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:13:52,563 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/phases_1-1.c [2020-07-28 18:13:52,568 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40334d3cb/0ef25abdbbc84480aac5e30be4d94b62/FLAGa1c47a5d9 [2020-07-28 18:13:53,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/40334d3cb/0ef25abdbbc84480aac5e30be4d94b62 [2020-07-28 18:13:53,011 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:13:53,015 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:13:53,019 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:53,019 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:13:53,022 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:13:53,024 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,027 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a2e7d9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53, skipping insertion in model container [2020-07-28 18:13:53,027 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,036 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:13:53,057 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:13:53,217 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:53,222 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:13:53,237 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:13:53,252 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:13:53,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53 WrapperNode [2020-07-28 18:13:53,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:13:53,253 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:53,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:13:53,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:13:53,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,336 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:13:53,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:13:53,337 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:13:53,337 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:13:53,344 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,349 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,355 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... [2020-07-28 18:13:53,357 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:13:53,357 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:13:53,358 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:13:53,358 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:13:53,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:13:53,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:13:53,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:13:53,643 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:13:53,643 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:13:53,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:53 BoogieIcfgContainer [2020-07-28 18:13:53,647 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:13:53,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:13:53,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:13:53,653 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:13:53,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:13:53" (1/3) ... [2020-07-28 18:13:53,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212fdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:53, skipping insertion in model container [2020-07-28 18:13:53,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:13:53" (2/3) ... [2020-07-28 18:13:53,656 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7212fdd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:13:53, skipping insertion in model container [2020-07-28 18:13:53,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:53" (3/3) ... [2020-07-28 18:13:53,658 INFO L109 eAbstractionObserver]: Analyzing ICFG phases_1-1.c [2020-07-28 18:13:53,670 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:13:53,678 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:13:53,695 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:13:53,731 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:13:53,731 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:13:53,731 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:13:53,732 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:13:53,732 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:13:53,732 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:13:53,733 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:13:53,733 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:13:53,753 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states. [2020-07-28 18:13:53,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:53,761 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:53,762 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:53,763 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:53,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:53,772 INFO L82 PathProgramCache]: Analyzing trace with hash 30108868, now seen corresponding path program 1 times [2020-07-28 18:13:53,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:53,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2117442097] [2020-07-28 18:13:53,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:53,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:53,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:13:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:53,845 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:53,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {13#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {13#true} is VALID [2020-07-28 18:13:53,880 INFO L280 TraceCheckUtils]: 1: Hoare triple {13#true} assume !true; {14#false} is VALID [2020-07-28 18:13:53,880 INFO L280 TraceCheckUtils]: 2: Hoare triple {14#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14#false} is VALID [2020-07-28 18:13:53,881 INFO L280 TraceCheckUtils]: 3: Hoare triple {14#false} assume 0bv32 == __VERIFIER_assert_~cond; {14#false} is VALID [2020-07-28 18:13:53,881 INFO L280 TraceCheckUtils]: 4: Hoare triple {14#false} assume !false; {14#false} is VALID [2020-07-28 18:13:53,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:53,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:53,898 INFO L280 TraceCheckUtils]: 4: Hoare triple {14#false} assume !false; {14#false} is VALID [2020-07-28 18:13:53,898 INFO L280 TraceCheckUtils]: 3: Hoare triple {14#false} assume 0bv32 == __VERIFIER_assert_~cond; {14#false} is VALID [2020-07-28 18:13:53,899 INFO L280 TraceCheckUtils]: 2: Hoare triple {14#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {14#false} is VALID [2020-07-28 18:13:53,904 INFO L280 TraceCheckUtils]: 1: Hoare triple {13#true} assume !true; {14#false} is VALID [2020-07-28 18:13:53,905 INFO L280 TraceCheckUtils]: 0: Hoare triple {13#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {13#true} is VALID [2020-07-28 18:13:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:53,906 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2117442097] [2020-07-28 18:13:53,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:53,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:13:53,909 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606402825] [2020-07-28 18:13:53,914 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:53,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:53,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:13:53,940 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:53,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:13:53,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:53,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:13:53,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:53,952 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 2 states. [2020-07-28 18:13:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:53,996 INFO L93 Difference]: Finished difference Result 17 states and 20 transitions. [2020-07-28 18:13:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:13:53,997 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:13:53,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2020-07-28 18:13:54,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:13:54,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 20 transitions. [2020-07-28 18:13:54,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 20 transitions. [2020-07-28 18:13:54,053 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:54,062 INFO L225 Difference]: With dead ends: 17 [2020-07-28 18:13:54,062 INFO L226 Difference]: Without dead ends: 7 [2020-07-28 18:13:54,065 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:13:54,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2020-07-28 18:13:54,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2020-07-28 18:13:54,088 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:54,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:54,089 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:54,090 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:54,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:54,092 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-28 18:13:54,092 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:54,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:54,092 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:54,093 INFO L74 IsIncluded]: Start isIncluded. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:54,093 INFO L87 Difference]: Start difference. First operand 7 states. Second operand 7 states. [2020-07-28 18:13:54,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:54,094 INFO L93 Difference]: Finished difference Result 7 states and 8 transitions. [2020-07-28 18:13:54,095 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:54,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:54,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:54,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:54,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:54,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:13:54,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 8 transitions. [2020-07-28 18:13:54,099 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 8 transitions. Word has length 5 [2020-07-28 18:13:54,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:54,100 INFO L479 AbstractCegarLoop]: Abstraction has 7 states and 8 transitions. [2020-07-28 18:13:54,100 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:13:54,101 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 8 transitions. [2020-07-28 18:13:54,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:13:54,101 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:54,102 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:13:54,313 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:13:54,314 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:54,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:54,314 INFO L82 PathProgramCache]: Analyzing trace with hash 29810958, now seen corresponding path program 1 times [2020-07-28 18:13:54,315 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:54,315 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [529442289] [2020-07-28 18:13:54,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:54,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 8 conjuncts, 2 conjunts are in the unsatisfiable core [2020-07-28 18:13:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:54,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:54,383 INFO L280 TraceCheckUtils]: 0: Hoare triple {83#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {88#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:54,386 INFO L280 TraceCheckUtils]: 1: Hoare triple {88#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 268435455bv32); {84#false} is VALID [2020-07-28 18:13:54,386 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {84#false} is VALID [2020-07-28 18:13:54,387 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#false} assume 0bv32 == __VERIFIER_assert_~cond; {84#false} is VALID [2020-07-28 18:13:54,387 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#false} assume !false; {84#false} is VALID [2020-07-28 18:13:54,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:54,390 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:54,419 INFO L280 TraceCheckUtils]: 4: Hoare triple {84#false} assume !false; {84#false} is VALID [2020-07-28 18:13:54,419 INFO L280 TraceCheckUtils]: 3: Hoare triple {84#false} assume 0bv32 == __VERIFIER_assert_~cond; {84#false} is VALID [2020-07-28 18:13:54,420 INFO L280 TraceCheckUtils]: 2: Hoare triple {84#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {84#false} is VALID [2020-07-28 18:13:54,421 INFO L280 TraceCheckUtils]: 1: Hoare triple {110#(bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))} assume !~bvult32(main_~x~0, 268435455bv32); {84#false} is VALID [2020-07-28 18:13:54,424 INFO L280 TraceCheckUtils]: 0: Hoare triple {83#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {110#(bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))} is VALID [2020-07-28 18:13:54,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:54,425 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [529442289] [2020-07-28 18:13:54,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:13:54,426 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 18:13:54,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912197727] [2020-07-28 18:13:54,431 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:54,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:54,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:13:54,450 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:54,451 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:13:54,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:54,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:13:54,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:54,452 INFO L87 Difference]: Start difference. First operand 7 states and 8 transitions. Second operand 4 states. [2020-07-28 18:13:54,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:54,541 INFO L93 Difference]: Finished difference Result 16 states and 21 transitions. [2020-07-28 18:13:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:13:54,541 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:13:54,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:54,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:54,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-28 18:13:54,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:13:54,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 21 transitions. [2020-07-28 18:13:54,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 21 transitions. [2020-07-28 18:13:54,588 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:54,589 INFO L225 Difference]: With dead ends: 16 [2020-07-28 18:13:54,589 INFO L226 Difference]: Without dead ends: 10 [2020-07-28 18:13:54,590 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:13:54,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-28 18:13:54,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-28 18:13:54,596 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:54,596 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2020-07-28 18:13:54,596 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:13:54,596 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:13:54,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:54,598 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-28 18:13:54,598 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-28 18:13:54,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:54,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:54,599 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:13:54,599 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:13:54,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:54,601 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2020-07-28 18:13:54,601 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-28 18:13:54,601 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:54,601 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:54,602 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:54,602 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:54,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:13:54,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 11 transitions. [2020-07-28 18:13:54,604 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 11 transitions. Word has length 5 [2020-07-28 18:13:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:54,604 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 11 transitions. [2020-07-28 18:13:54,604 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:13:54,604 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 11 transitions. [2020-07-28 18:13:54,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:13:54,605 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:54,605 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:54,806 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:13:54,806 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:54,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:54,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1492282070, now seen corresponding path program 1 times [2020-07-28 18:13:54,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:54,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [908143010] [2020-07-28 18:13:54,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2020-07-28 18:13:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:54,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 3 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:54,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:54,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:54,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {171#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:54,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {171#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {171#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:54,885 INFO L280 TraceCheckUtils]: 2: Hoare triple {171#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {178#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:54,886 INFO L280 TraceCheckUtils]: 3: Hoare triple {178#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {178#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:54,887 INFO L280 TraceCheckUtils]: 4: Hoare triple {178#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {167#false} is VALID [2020-07-28 18:13:54,888 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#false} assume !~bvult32(main_~x~0, 268435455bv32); {167#false} is VALID [2020-07-28 18:13:54,888 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {167#false} is VALID [2020-07-28 18:13:54,888 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#false} assume 0bv32 == __VERIFIER_assert_~cond; {167#false} is VALID [2020-07-28 18:13:54,889 INFO L280 TraceCheckUtils]: 8: Hoare triple {167#false} assume !false; {167#false} is VALID [2020-07-28 18:13:54,890 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:54,890 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:54,938 INFO L280 TraceCheckUtils]: 8: Hoare triple {167#false} assume !false; {167#false} is VALID [2020-07-28 18:13:54,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {167#false} assume 0bv32 == __VERIFIER_assert_~cond; {167#false} is VALID [2020-07-28 18:13:54,939 INFO L280 TraceCheckUtils]: 6: Hoare triple {167#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {167#false} is VALID [2020-07-28 18:13:54,940 INFO L280 TraceCheckUtils]: 5: Hoare triple {167#false} assume !~bvult32(main_~x~0, 268435455bv32); {167#false} is VALID [2020-07-28 18:13:54,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {209#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {167#false} is VALID [2020-07-28 18:13:54,943 INFO L280 TraceCheckUtils]: 3: Hoare triple {209#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {209#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} is VALID [2020-07-28 18:13:54,947 INFO L280 TraceCheckUtils]: 2: Hoare triple {216#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {209#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} is VALID [2020-07-28 18:13:54,949 INFO L280 TraceCheckUtils]: 1: Hoare triple {216#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {216#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:54,951 INFO L280 TraceCheckUtils]: 0: Hoare triple {166#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {216#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:54,952 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [908143010] [2020-07-28 18:13:54,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:54,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-28 18:13:54,953 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140516195] [2020-07-28 18:13:54,954 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 18:13:54,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:54,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:13:54,983 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:54,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:13:54,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:54,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:13:54,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:13:54,985 INFO L87 Difference]: Start difference. First operand 10 states and 11 transitions. Second operand 6 states. [2020-07-28 18:13:55,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:55,126 INFO L93 Difference]: Finished difference Result 23 states and 28 transitions. [2020-07-28 18:13:55,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:13:55,127 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 9 [2020-07-28 18:13:55,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:55,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:13:55,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-28 18:13:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:13:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 26 transitions. [2020-07-28 18:13:55,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 26 transitions. [2020-07-28 18:13:55,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:55,192 INFO L225 Difference]: With dead ends: 23 [2020-07-28 18:13:55,192 INFO L226 Difference]: Without dead ends: 16 [2020-07-28 18:13:55,193 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:13:55,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-28 18:13:55,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-28 18:13:55,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:55,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:55,209 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:55,209 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:55,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:55,211 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-28 18:13:55,211 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 18:13:55,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:55,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:55,214 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:55,215 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-28 18:13:55,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:55,219 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2020-07-28 18:13:55,219 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 18:13:55,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:55,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:55,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:55,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:55,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-28 18:13:55,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2020-07-28 18:13:55,227 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 9 [2020-07-28 18:13:55,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:55,227 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2020-07-28 18:13:55,228 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:13:55,228 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2020-07-28 18:13:55,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-07-28 18:13:55,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:55,231 INFO L422 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:55,444 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:13:55,444 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:55,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:55,445 INFO L82 PathProgramCache]: Analyzing trace with hash -368533665, now seen corresponding path program 2 times [2020-07-28 18:13:55,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:55,446 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [30888335] [2020-07-28 18:13:55,446 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:55,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:13:55,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:13:55,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:13:55,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:55,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:55,595 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {314#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {314#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {314#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,598 INFO L280 TraceCheckUtils]: 2: Hoare triple {314#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {321#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,598 INFO L280 TraceCheckUtils]: 3: Hoare triple {321#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {321#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,600 INFO L280 TraceCheckUtils]: 4: Hoare triple {321#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {328#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,601 INFO L280 TraceCheckUtils]: 5: Hoare triple {328#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {328#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,602 INFO L280 TraceCheckUtils]: 6: Hoare triple {328#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {335#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,603 INFO L280 TraceCheckUtils]: 7: Hoare triple {335#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {335#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,604 INFO L280 TraceCheckUtils]: 8: Hoare triple {335#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {342#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,605 INFO L280 TraceCheckUtils]: 9: Hoare triple {342#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, 268435455bv32); {342#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:13:55,606 INFO L280 TraceCheckUtils]: 10: Hoare triple {342#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {310#false} is VALID [2020-07-28 18:13:55,607 INFO L280 TraceCheckUtils]: 11: Hoare triple {310#false} assume !~bvult32(main_~x~0, 268435455bv32); {310#false} is VALID [2020-07-28 18:13:55,607 INFO L280 TraceCheckUtils]: 12: Hoare triple {310#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {310#false} is VALID [2020-07-28 18:13:55,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {310#false} assume 0bv32 == __VERIFIER_assert_~cond; {310#false} is VALID [2020-07-28 18:13:55,608 INFO L280 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2020-07-28 18:13:55,614 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:55,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:55,773 INFO L280 TraceCheckUtils]: 14: Hoare triple {310#false} assume !false; {310#false} is VALID [2020-07-28 18:13:55,773 INFO L280 TraceCheckUtils]: 13: Hoare triple {310#false} assume 0bv32 == __VERIFIER_assert_~cond; {310#false} is VALID [2020-07-28 18:13:55,774 INFO L280 TraceCheckUtils]: 12: Hoare triple {310#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {310#false} is VALID [2020-07-28 18:13:55,774 INFO L280 TraceCheckUtils]: 11: Hoare triple {310#false} assume !~bvult32(main_~x~0, 268435455bv32); {310#false} is VALID [2020-07-28 18:13:55,774 INFO L280 TraceCheckUtils]: 10: Hoare triple {373#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {310#false} is VALID [2020-07-28 18:13:55,775 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {373#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} is VALID [2020-07-28 18:13:55,778 INFO L280 TraceCheckUtils]: 8: Hoare triple {380#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {373#(bvult ULTIMATE.start_main_~x~0 (_ bv65520 32))} is VALID [2020-07-28 18:13:55,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {380#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {380#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {387#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv65520 32))} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {380#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,784 INFO L280 TraceCheckUtils]: 5: Hoare triple {387#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {387#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,788 INFO L280 TraceCheckUtils]: 4: Hoare triple {394#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv65520 32))} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {387#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,789 INFO L280 TraceCheckUtils]: 3: Hoare triple {394#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {394#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,792 INFO L280 TraceCheckUtils]: 2: Hoare triple {401#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv65520 32))} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {394#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,793 INFO L280 TraceCheckUtils]: 1: Hoare triple {401#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {401#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,793 INFO L280 TraceCheckUtils]: 0: Hoare triple {309#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {401#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:55,794 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:13:55,795 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [30888335] [2020-07-28 18:13:55,795 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:55,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2020-07-28 18:13:55,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81634543] [2020-07-28 18:13:55,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-07-28 18:13:55,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:55,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-28 18:13:55,861 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:55,862 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-28 18:13:55,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-28 18:13:55,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:13:55,863 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 12 states. [2020-07-28 18:13:56,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:56,420 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2020-07-28 18:13:56,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 18:13:56,420 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2020-07-28 18:13:56,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:56,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:13:56,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-28 18:13:56,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:13:56,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 41 transitions. [2020-07-28 18:13:56,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 41 transitions. [2020-07-28 18:13:56,523 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:56,525 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:13:56,525 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:13:56,526 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2020-07-28 18:13:56,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:13:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 18:13:56,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:56,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 18:13:56,547 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:13:56,547 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:13:56,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:56,550 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-28 18:13:56,550 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-28 18:13:56,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:56,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:56,551 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:13:56,552 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:13:56,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:56,554 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-28 18:13:56,554 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-28 18:13:56,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:56,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:56,555 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:56,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:13:56,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-28 18:13:56,558 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 15 [2020-07-28 18:13:56,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:56,559 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-28 18:13:56,559 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-28 18:13:56,559 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-28 18:13:56,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-28 18:13:56,560 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:13:56,561 INFO L422 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1, 1, 1, 1] [2020-07-28 18:13:56,769 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:13:56,769 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:13:56,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:13:56,770 INFO L82 PathProgramCache]: Analyzing trace with hash -949733327, now seen corresponding path program 3 times [2020-07-28 18:13:56,773 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:13:56,774 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [579859600] [2020-07-28 18:13:56,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2020-07-28 18:13:56,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-28 18:13:56,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:13:56,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-28 18:13:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:13:56,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:13:56,868 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {560#true} is VALID [2020-07-28 18:13:56,869 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,869 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,869 INFO L280 TraceCheckUtils]: 3: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,870 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,870 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,871 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,871 INFO L280 TraceCheckUtils]: 7: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,871 INFO L280 TraceCheckUtils]: 8: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,872 INFO L280 TraceCheckUtils]: 9: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,872 INFO L280 TraceCheckUtils]: 10: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,872 INFO L280 TraceCheckUtils]: 11: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,872 INFO L280 TraceCheckUtils]: 12: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,873 INFO L280 TraceCheckUtils]: 13: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,873 INFO L280 TraceCheckUtils]: 14: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,873 INFO L280 TraceCheckUtils]: 15: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,873 INFO L280 TraceCheckUtils]: 16: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,874 INFO L280 TraceCheckUtils]: 17: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,874 INFO L280 TraceCheckUtils]: 18: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:56,874 INFO L280 TraceCheckUtils]: 19: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:56,876 INFO L280 TraceCheckUtils]: 20: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {625#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:56,877 INFO L280 TraceCheckUtils]: 21: Hoare triple {625#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv65520 32))} assume !!~bvult32(main_~x~0, 268435455bv32); {625#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:56,881 INFO L280 TraceCheckUtils]: 22: Hoare triple {625#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv65520 32))} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {632#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967293 32)) (_ bv65520 32))} is VALID [2020-07-28 18:13:56,883 INFO L280 TraceCheckUtils]: 23: Hoare triple {632#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967293 32)) (_ bv65520 32))} assume !~bvult32(main_~x~0, 268435455bv32); {561#false} is VALID [2020-07-28 18:13:56,883 INFO L280 TraceCheckUtils]: 24: Hoare triple {561#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {561#false} is VALID [2020-07-28 18:13:56,883 INFO L280 TraceCheckUtils]: 25: Hoare triple {561#false} assume 0bv32 == __VERIFIER_assert_~cond; {561#false} is VALID [2020-07-28 18:13:56,884 INFO L280 TraceCheckUtils]: 26: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-28 18:13:56,885 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-07-28 18:13:56,885 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:13:57,092 INFO L280 TraceCheckUtils]: 26: Hoare triple {561#false} assume !false; {561#false} is VALID [2020-07-28 18:13:57,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {648#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {561#false} is VALID [2020-07-28 18:13:57,094 INFO L280 TraceCheckUtils]: 24: Hoare triple {652#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32))} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~x~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {648#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:13:57,094 INFO L280 TraceCheckUtils]: 23: Hoare triple {656#(or (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32)) (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32)))} assume !~bvult32(main_~x~0, 268435455bv32); {652#(= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:13:57,096 INFO L280 TraceCheckUtils]: 22: Hoare triple {660#(or (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32))) (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)))} assume !~bvult32(main_~x~0, 65520bv32);main_~x~0 := ~bvadd32(2bv32, main_~x~0); {656#(or (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32)) (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32)))} is VALID [2020-07-28 18:13:57,096 INFO L280 TraceCheckUtils]: 21: Hoare triple {664#(or (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32))) (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))))} assume !!~bvult32(main_~x~0, 268435455bv32); {660#(or (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32))) (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)))} is VALID [2020-07-28 18:13:57,098 INFO L280 TraceCheckUtils]: 20: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {664#(or (= (_ bv0 32) (bvurem (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv2 32))) (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv268435455 32)) (not (bvult ULTIMATE.start_main_~x~0 (_ bv268435455 32))))} is VALID [2020-07-28 18:13:57,098 INFO L280 TraceCheckUtils]: 19: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,099 INFO L280 TraceCheckUtils]: 18: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,099 INFO L280 TraceCheckUtils]: 17: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,099 INFO L280 TraceCheckUtils]: 16: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,100 INFO L280 TraceCheckUtils]: 15: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,101 INFO L280 TraceCheckUtils]: 14: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,101 INFO L280 TraceCheckUtils]: 13: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,101 INFO L280 TraceCheckUtils]: 12: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,102 INFO L280 TraceCheckUtils]: 11: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,102 INFO L280 TraceCheckUtils]: 10: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,102 INFO L280 TraceCheckUtils]: 9: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,102 INFO L280 TraceCheckUtils]: 8: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,103 INFO L280 TraceCheckUtils]: 6: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,104 INFO L280 TraceCheckUtils]: 4: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,104 INFO L280 TraceCheckUtils]: 3: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,104 INFO L280 TraceCheckUtils]: 2: Hoare triple {560#true} assume ~bvult32(main_~x~0, 65520bv32);main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {560#true} is VALID [2020-07-28 18:13:57,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {560#true} assume !!~bvult32(main_~x~0, 268435455bv32); {560#true} is VALID [2020-07-28 18:13:57,105 INFO L280 TraceCheckUtils]: 0: Hoare triple {560#true} havoc main_#res;havoc main_#t~post0, main_~x~0;main_~x~0 := 0bv32; {560#true} is VALID [2020-07-28 18:13:57,106 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 30 proven. 1 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2020-07-28 18:13:57,107 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [579859600] [2020-07-28 18:13:57,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:13:57,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7] total 9 [2020-07-28 18:13:57,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577824125] [2020-07-28 18:13:57,108 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-28 18:13:57,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:13:57,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-28 18:13:57,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:57,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-28 18:13:57,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:13:57,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-28 18:13:57,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:13:57,134 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 9 states. [2020-07-28 18:13:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:57,609 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-28 18:13:57,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 18:13:57,609 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-07-28 18:13:57,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:13:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:13:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-28 18:13:57,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:13:57,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2020-07-28 18:13:57,620 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 20 transitions. [2020-07-28 18:13:57,684 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:13:57,685 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:13:57,685 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:13:57,686 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2020-07-28 18:13:57,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:13:57,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:13:57,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:13:57,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:57,687 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:57,687 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:57,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:57,687 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:57,688 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:57,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:57,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:57,688 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:57,688 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:13:57,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:13:57,689 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:13:57,689 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:57,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:57,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:13:57,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:13:57,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:13:57,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:13:57,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:13:57,690 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2020-07-28 18:13:57,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:13:57,690 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:13:57,690 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-28 18:13:57,690 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:13:57,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:13:57,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:13:57,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:13:58,022 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:13:58,022 INFO L268 CegarLoopResult]: For program point L13-2(lines 13 19) no Hoare annotation was computed. [2020-07-28 18:13:58,022 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 18:13:58,022 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:13:58,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:13:58,023 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2020-07-28 18:13:58,023 INFO L268 CegarLoopResult]: For program point L14(lines 14 18) no Hoare annotation was computed. [2020-07-28 18:13:58,023 INFO L264 CegarLoopResult]: At program point L14-2(lines 13 19) the Hoare annotation is: (or (= (bvurem ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv0 32)) (bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv4294967295 32)) (_ bv65520 32))) [2020-07-28 18:13:58,023 INFO L268 CegarLoopResult]: For program point L4(lines 4 6) no Hoare annotation was computed. [2020-07-28 18:13:58,024 INFO L271 CegarLoopResult]: At program point L4-2(lines 1 22) the Hoare annotation is: true [2020-07-28 18:13:58,029 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:13:58,029 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:13:58,029 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:13:58,029 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:13:58,030 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-28 18:13:58,030 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:13:58,030 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 18:13:58,030 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:58,030 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-28 18:13:58,031 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:58,031 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 18:13:58,031 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:58,031 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:13:58,032 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. [2020-07-28 18:13:58,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:13:58 BoogieIcfgContainer [2020-07-28 18:13:58,049 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:13:58,050 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:13:58,050 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:13:58,050 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:13:58,051 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:13:53" (3/4) ... [2020-07-28 18:13:58,055 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:13:58,070 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:13:58,070 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:13:58,125 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:13:58,125 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:13:58,128 INFO L168 Benchmark]: Toolchain (without parser) took 5115.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 960.2 MB in the beginning and 803.1 MB in the end (delta: 157.1 MB). Peak memory consumption was 279.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:58,128 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:58,129 INFO L168 Benchmark]: CACSL2BoogieTranslator took 234.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:58,129 INFO L168 Benchmark]: Boogie Procedure Inliner took 83.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:58,130 INFO L168 Benchmark]: Boogie Preprocessor took 20.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:58,130 INFO L168 Benchmark]: RCFGBuilder took 290.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:58,131 INFO L168 Benchmark]: TraceAbstraction took 4400.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 803.1 MB in the end (delta: 295.3 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. [2020-07-28 18:13:58,131 INFO L168 Benchmark]: Witness Printer took 75.47 ms. Allocated memory is still 1.2 GB. Free memory is still 803.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:13:58,134 INFO L336 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 234.03 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 83.45 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -169.2 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 20.25 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 290.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4400.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 803.1 MB in the end (delta: 295.3 MB). Peak memory consumption was 295.3 MB. Max. memory is 11.5 GB. * Witness Printer took 75.47 ms. Allocated memory is still 1.2 GB. Free memory is still 803.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 13]: Loop Invariant Derived loop invariant: ~bvurem32(x, 2bv32) == 0bv32 || ~bvult32(~bvadd64(x, 4294967295bv32), 65520bv32) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 10 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.1s, OverallIterations: 5, TraceHistogramMax: 11, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 14 SDslu, 21 SDs, 0 SdLazy, 161 SolverSat, 31 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 17 NumberOfFragments, 12 HoareAnnotationTreeSize, 2 FomulaSimplifications, 173 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 61 NumberOfCodeBlocks, 45 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 112 ConstructedInterpolants, 0 QuantifiedInterpolants, 4326 SizeOfPredicates, 2 NumberOfNonLiveVariables, 70 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 254/300 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 proved your program to be correct! Received shutdown request...