./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops-crafted-1/mono-crafted_12.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/loops-crafted-1/mono-crafted_12.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 31139cb502d42469f9dfd953df6505811701000c ..................................................................................................................................................................................................................................................................................................................... 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/loops-crafted-1/mono-crafted_12.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 31139cb502d42469f9dfd953df6505811701000c ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:22:09,320 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:22:09,322 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:22:09,335 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:22:09,336 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:22:09,337 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:22:09,338 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:22:09,340 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:22:09,342 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:22:09,343 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:22:09,345 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:22:09,346 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:22:09,346 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:22:09,347 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:22:09,348 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:22:09,350 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:22:09,351 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:22:09,352 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:22:09,354 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:22:09,356 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:22:09,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:22:09,359 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:22:09,360 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:22:09,361 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:22:09,364 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:22:09,364 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:22:09,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:22:09,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:22:09,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:22:09,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:22:09,367 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:22:09,368 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:22:09,369 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:22:09,370 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:22:09,371 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:22:09,371 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:22:09,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:22:09,372 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:22:09,373 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:22:09,374 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:22:09,375 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:22:09,376 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:22:09,391 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:22:09,391 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:22:09,392 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:22:09,393 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:22:09,393 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:22:09,393 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:22:09,394 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:22:09,394 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:22:09,394 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:22:09,394 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:22:09,395 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:22:09,395 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:22:09,395 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:22:09,395 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:22:09,396 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:22:09,396 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:22:09,396 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:22:09,397 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:22:09,397 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:22:09,397 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:22:09,397 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:22:09,398 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:22:09,398 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:22:09,398 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:22:09,399 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:22:09,399 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:22:09,399 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:22:09,401 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:22:09,401 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:22:09,402 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 -> 31139cb502d42469f9dfd953df6505811701000c [2020-07-28 18:22:09,718 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:22:09,736 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:22:09,739 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:22:09,741 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:22:09,742 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:22:09,743 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_12.c [2020-07-28 18:22:09,812 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2ac38e6/630a970c2352471ca8788e1d2b74ce27/FLAG034614c03 [2020-07-28 18:22:10,252 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:22:10,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_12.c [2020-07-28 18:22:10,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2ac38e6/630a970c2352471ca8788e1d2b74ce27/FLAG034614c03 [2020-07-28 18:22:10,651 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e2ac38e6/630a970c2352471ca8788e1d2b74ce27 [2020-07-28 18:22:10,655 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:22:10,658 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:22:10,660 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:22:10,660 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:22:10,664 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:22:10,665 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:10,669 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3516801e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10, skipping insertion in model container [2020-07-28 18:22:10,669 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:10,677 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:22:10,699 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:22:10,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:22:10,890 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:22:10,907 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:22:10,923 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:22:10,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10 WrapperNode [2020-07-28 18:22:10,924 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:22:10,925 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:22:10,925 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:22:10,925 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:22:10,934 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:22:10" (1/1) ... [2020-07-28 18:22:10,940 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:22:10" (1/1) ... [2020-07-28 18:22:11,017 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:22:11,018 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:22:11,018 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:22:11,018 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:22:11,031 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,031 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,032 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,033 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,037 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,042 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,043 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (1/1) ... [2020-07-28 18:22:11,045 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:22:11,045 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:22:11,045 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:22:11,045 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:22:11,046 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (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:22:11,104 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:22:11,105 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:22:11,339 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:22:11,339 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:22:11,343 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:22:11 BoogieIcfgContainer [2020-07-28 18:22:11,344 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:22:11,345 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:22:11,345 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:22:11,349 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:22:11,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:22:10" (1/3) ... [2020-07-28 18:22:11,350 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24815ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:22:11, skipping insertion in model container [2020-07-28 18:22:11,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:10" (2/3) ... [2020-07-28 18:22:11,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24815ad5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:22:11, skipping insertion in model container [2020-07-28 18:22:11,352 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:22:11" (3/3) ... [2020-07-28 18:22:11,354 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-28 18:22:11,370 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:22:11,387 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:22:11,409 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:22:11,436 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:22:11,437 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:22:11,437 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:22:11,437 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:22:11,438 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:22:11,438 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:22:11,438 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:22:11,438 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:22:11,455 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:22:11,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:22:11,461 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:11,462 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:22:11,463 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:11,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:11,469 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2020-07-28 18:22:11,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:22:11,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599741684] [2020-07-28 18:22:11,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:22:11,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:11,594 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0;main_~y~0 := 10000000;main_~z~0 := 0; {15#true} is VALID [2020-07-28 18:22:11,596 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:22:11,597 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#false} __VERIFIER_assert_#in~cond := (if 0 == (if main_~z~0 % 4294967296 < 0 && 0 != main_~z~0 % 4294967296 % 2 then main_~z~0 % 4294967296 % 2 - 2 else main_~z~0 % 4294967296 % 2) % 4294967296 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:22:11,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:22:11,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:22:11,600 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:22:11,601 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599741684] [2020-07-28 18:22:11,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:22:11,603 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 18:22:11,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099156973] [2020-07-28 18:22:11,610 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:22:11,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:11,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:22:11,633 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:22:11,634 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:22:11,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:22:11,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:22:11,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:22:11,646 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 18:22:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:11,687 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 18:22:11,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:22:11,688 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:22:11,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:11,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:22:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:22:11,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:22:11,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:22:11,699 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2020-07-28 18:22:11,743 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:11,753 INFO L225 Difference]: With dead ends: 20 [2020-07-28 18:22:11,754 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:22:11,757 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:22:11,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:22:11,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:22:11,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:11,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:11,787 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:11,787 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:11,792 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:22:11,792 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:11,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:11,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:11,793 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:11,793 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:11,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:11,797 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:22:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:11,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:11,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:11,798 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:11,798 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:11,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:22:11,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-28 18:22:11,803 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2020-07-28 18:22:11,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:11,804 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-28 18:22:11,805 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:22:11,806 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:11,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:22:11,807 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:11,807 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:22:11,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:22:11,808 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:11,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:11,809 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2020-07-28 18:22:11,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:22:11,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465278430] [2020-07-28 18:22:11,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:22:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:11,871 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:22:11,872 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:22:11,882 INFO L168 Benchmark]: Toolchain (without parser) took 1225.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -114.4 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:11,883 INFO L168 Benchmark]: CDTParser took 0.79 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:22:11,884 INFO L168 Benchmark]: CACSL2BoogieTranslator took 264.40 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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:22:11,885 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:11,886 INFO L168 Benchmark]: Boogie Preprocessor took 26.68 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:22:11,887 INFO L168 Benchmark]: RCFGBuilder took 298.67 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.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:11,888 INFO L168 Benchmark]: TraceAbstraction took 534.22 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: 26.4 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:11,893 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.79 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 264.40 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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 93.29 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -178.2 MB). Peak memory consumption was 9.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.68 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 298.67 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.1 MB). Peak memory consumption was 20.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 534.22 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: 26.4 MB). Peak memory consumption was 26.4 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:22:13,857 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:22:13,860 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:22:13,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:22:13,874 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:22:13,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:22:13,876 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:22:13,879 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:22:13,881 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:22:13,882 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:22:13,883 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:22:13,884 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:22:13,885 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:22:13,886 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:22:13,887 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:22:13,889 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:22:13,890 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:22:13,891 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:22:13,893 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:22:13,895 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:22:13,897 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:22:13,898 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:22:13,899 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:22:13,900 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:22:13,903 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:22:13,903 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:22:13,904 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:22:13,905 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:22:13,905 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:22:13,906 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:22:13,907 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:22:13,907 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:22:13,908 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:22:13,909 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:22:13,910 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:22:13,910 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:22:13,911 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:22:13,911 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:22:13,912 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:22:13,913 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:22:13,914 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:22:13,915 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:22:13,938 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:22:13,938 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:22:13,940 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:22:13,941 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:22:13,941 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:22:13,941 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:22:13,942 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:22:13,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:22:13,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:22:13,942 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:22:13,944 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:22:13,944 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:22:13,944 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2020-07-28 18:22:13,945 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2020-07-28 18:22:13,945 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:22:13,945 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:22:13,946 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:22:13,946 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:22:13,946 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:22:13,946 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:22:13,947 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:22:13,947 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:22:13,948 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:22:13,948 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:22:13,948 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:22:13,948 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:22:13,949 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2020-07-28 18:22:13,949 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2020-07-28 18:22:13,949 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:22:13,949 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:22:13,950 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-28 18:22:13,950 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 -> 31139cb502d42469f9dfd953df6505811701000c [2020-07-28 18:22:14,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:22:14,315 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:22:14,319 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:22:14,321 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:22:14,321 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:22:14,322 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops-crafted-1/mono-crafted_12.c [2020-07-28 18:22:14,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be9af689/4f244af191084635b8d392c5e7e7fb25/FLAGf74bfa874 [2020-07-28 18:22:14,817 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:22:14,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops-crafted-1/mono-crafted_12.c [2020-07-28 18:22:14,822 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be9af689/4f244af191084635b8d392c5e7e7fb25/FLAGf74bfa874 [2020-07-28 18:22:15,180 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1be9af689/4f244af191084635b8d392c5e7e7fb25 [2020-07-28 18:22:15,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:22:15,186 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:22:15,187 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:22:15,188 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:22:15,191 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:22:15,193 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,196 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f7c72a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15, skipping insertion in model container [2020-07-28 18:22:15,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:22:15,222 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:22:15,402 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:22:15,408 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:22:15,424 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:22:15,439 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:22:15,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15 WrapperNode [2020-07-28 18:22:15,440 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:22:15,441 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:22:15,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:22:15,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:22:15,450 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:22:15" (1/1) ... [2020-07-28 18:22:15,458 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:22:15" (1/1) ... [2020-07-28 18:22:15,539 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:22:15,540 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:22:15,540 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:22:15,541 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:22:15,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,550 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,551 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,559 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (1/1) ... [2020-07-28 18:22:15,562 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:22:15,563 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:22:15,563 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:22:15,563 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:22:15,564 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (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:22:15,627 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:22:15,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:22:15,852 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:22:15,852 INFO L295 CfgBuilder]: Removed 7 assume(true) statements. [2020-07-28 18:22:15,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:22:15 BoogieIcfgContainer [2020-07-28 18:22:15,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:22:15,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:22:15,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:22:15,863 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:22:15,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:22:15" (1/3) ... [2020-07-28 18:22:15,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8000e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:22:15, skipping insertion in model container [2020-07-28 18:22:15,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:22:15" (2/3) ... [2020-07-28 18:22:15,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8000e79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:22:15, skipping insertion in model container [2020-07-28 18:22:15,866 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:22:15" (3/3) ... [2020-07-28 18:22:15,868 INFO L109 eAbstractionObserver]: Analyzing ICFG mono-crafted_12.c [2020-07-28 18:22:15,880 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:22:15,890 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:22:15,910 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:22:15,954 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:22:15,954 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:22:15,955 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:22:15,957 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:22:15,958 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:22:15,958 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:22:15,958 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:22:15,958 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:22:15,993 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states. [2020-07-28 18:22:16,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:22:16,006 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:16,007 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:22:16,007 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:16,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:16,019 INFO L82 PathProgramCache]: Analyzing trace with hash 30139652, now seen corresponding path program 1 times [2020-07-28 18:22:16,035 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:16,036 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1810460629] [2020-07-28 18:22:16,036 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:22:16,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:16,080 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 1 conjunts are in the unsatisfiable core [2020-07-28 18:22:16,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:16,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:16,121 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {15#true} is VALID [2020-07-28 18:22:16,123 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:22:16,123 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:22:16,124 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:22:16,124 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:22:16,126 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:22:16,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:16,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#false} assume !false; {16#false} is VALID [2020-07-28 18:22:16,140 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#false} assume 0bv32 == __VERIFIER_assert_~cond; {16#false} is VALID [2020-07-28 18:22:16,140 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {16#false} is VALID [2020-07-28 18:22:16,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {15#true} assume !true; {16#false} is VALID [2020-07-28 18:22:16,142 INFO L280 TraceCheckUtils]: 0: Hoare triple {15#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {15#true} is VALID [2020-07-28 18:22:16,142 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:22:16,143 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1810460629] [2020-07-28 18:22:16,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:22:16,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2020-07-28 18:22:16,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988289709] [2020-07-28 18:22:16,151 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:22:16,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:16,156 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 18:22:16,177 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:22:16,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 18:22:16,178 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:16,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 18:22:16,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 18:22:16,187 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 2 states. [2020-07-28 18:22:16,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,238 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2020-07-28 18:22:16,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 18:22:16,238 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 5 [2020-07-28 18:22:16,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:16,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:22:16,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:22:16,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 18:22:16,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 23 transitions. [2020-07-28 18:22:16,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 23 transitions. [2020-07-28 18:22:16,303 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:16,313 INFO L225 Difference]: With dead ends: 20 [2020-07-28 18:22:16,313 INFO L226 Difference]: Without dead ends: 8 [2020-07-28 18:22:16,316 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:22:16,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2020-07-28 18:22:16,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2020-07-28 18:22:16,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:16,347 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:16,347 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:16,347 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:16,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,349 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:22:16,350 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:16,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:16,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:16,350 INFO L74 IsIncluded]: Start isIncluded. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:16,351 INFO L87 Difference]: Start difference. First operand 8 states. Second operand 8 states. [2020-07-28 18:22:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,352 INFO L93 Difference]: Finished difference Result 8 states and 9 transitions. [2020-07-28 18:22:16,352 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:16,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:16,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:16,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:16,354 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:16,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:22:16,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 9 transitions. [2020-07-28 18:22:16,357 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 9 transitions. Word has length 5 [2020-07-28 18:22:16,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:16,357 INFO L479 AbstractCegarLoop]: Abstraction has 8 states and 9 transitions. [2020-07-28 18:22:16,357 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 18:22:16,358 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 9 transitions. [2020-07-28 18:22:16,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-28 18:22:16,358 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:16,358 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-28 18:22:16,569 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2020-07-28 18:22:16,570 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash 29811951, now seen corresponding path program 1 times [2020-07-28 18:22:16,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:16,577 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1420888491] [2020-07-28 18:22:16,578 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) [2020-07-28 18:22:16,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:16,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 3 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2020-07-28 18:22:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:16,618 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:16,664 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {96#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:16,667 INFO L280 TraceCheckUtils]: 1: Hoare triple {96#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} assume !~bvult32(main_~x~0, main_~y~0); {92#false} is VALID [2020-07-28 18:22:16,667 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {92#false} is VALID [2020-07-28 18:22:16,668 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#false} assume 0bv32 == __VERIFIER_assert_~cond; {92#false} is VALID [2020-07-28 18:22:16,668 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-28 18:22:16,668 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:22:16,669 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:16,688 INFO L280 TraceCheckUtils]: 4: Hoare triple {92#false} assume !false; {92#false} is VALID [2020-07-28 18:22:16,689 INFO L280 TraceCheckUtils]: 3: Hoare triple {92#false} assume 0bv32 == __VERIFIER_assert_~cond; {92#false} is VALID [2020-07-28 18:22:16,689 INFO L280 TraceCheckUtils]: 2: Hoare triple {92#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {92#false} is VALID [2020-07-28 18:22:16,690 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#(bvult ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} assume !~bvult32(main_~x~0, main_~y~0); {92#false} is VALID [2020-07-28 18:22:16,691 INFO L280 TraceCheckUtils]: 0: Hoare triple {91#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {118#(bvult ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:16,691 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:22:16,692 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1420888491] [2020-07-28 18:22:16,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:22:16,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2020-07-28 18:22:16,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171135289] [2020-07-28 18:22:16,694 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:22:16,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:16,695 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:22:16,705 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:22:16,705 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:22:16,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:16,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:22:16,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:22:16,706 INFO L87 Difference]: Start difference. First operand 8 states and 9 transitions. Second operand 4 states. [2020-07-28 18:22:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,787 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2020-07-28 18:22:16,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:22:16,787 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 5 [2020-07-28 18:22:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:16,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:22:16,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:22:16,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:22:16,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 24 transitions. [2020-07-28 18:22:16,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 24 transitions. [2020-07-28 18:22:16,834 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:16,835 INFO L225 Difference]: With dead ends: 19 [2020-07-28 18:22:16,835 INFO L226 Difference]: Without dead ends: 12 [2020-07-28 18:22:16,837 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:22:16,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2020-07-28 18:22:16,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2020-07-28 18:22:16,848 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:16,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2020-07-28 18:22:16,848 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:22:16,849 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:22:16,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,851 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-28 18:22:16,851 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-28 18:22:16,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:16,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:16,852 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2020-07-28 18:22:16,852 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2020-07-28 18:22:16,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:16,854 INFO L93 Difference]: Finished difference Result 12 states and 13 transitions. [2020-07-28 18:22:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-28 18:22:16,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:16,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:16,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:16,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-28 18:22:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 13 transitions. [2020-07-28 18:22:16,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 13 transitions. Word has length 5 [2020-07-28 18:22:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:16,858 INFO L479 AbstractCegarLoop]: Abstraction has 12 states and 13 transitions. [2020-07-28 18:22:16,858 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:22:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 13 transitions. [2020-07-28 18:22:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:22:16,859 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:16,859 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:22:17,071 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2020-07-28 18:22:17,073 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:17,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:17,074 INFO L82 PathProgramCache]: Analyzing trace with hash -443804623, now seen corresponding path program 1 times [2020-07-28 18:22:17,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:17,075 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52825195] [2020-07-28 18:22:17,075 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) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2020-07-28 18:22:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:17,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 17 conjuncts, 3 conjunts are in the unsatisfiable core [2020-07-28 18:22:17,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:17,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:17,163 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:17,165 INFO L280 TraceCheckUtils]: 1: Hoare triple {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:17,165 INFO L280 TraceCheckUtils]: 2: Hoare triple {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:17,166 INFO L280 TraceCheckUtils]: 3: Hoare triple {188#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {198#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:17,167 INFO L280 TraceCheckUtils]: 4: Hoare triple {198#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {198#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:17,168 INFO L280 TraceCheckUtils]: 5: Hoare triple {198#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {184#false} is VALID [2020-07-28 18:22:17,168 INFO L280 TraceCheckUtils]: 6: Hoare triple {184#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {184#false} is VALID [2020-07-28 18:22:17,168 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#false} assume !~bvult32(main_~x~0, main_~y~0); {184#false} is VALID [2020-07-28 18:22:17,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {184#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {184#false} is VALID [2020-07-28 18:22:17,169 INFO L280 TraceCheckUtils]: 9: Hoare triple {184#false} assume 0bv32 == __VERIFIER_assert_~cond; {184#false} is VALID [2020-07-28 18:22:17,169 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false; {184#false} is VALID [2020-07-28 18:22:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:22:17,171 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:17,227 INFO L280 TraceCheckUtils]: 10: Hoare triple {184#false} assume !false; {184#false} is VALID [2020-07-28 18:22:17,228 INFO L280 TraceCheckUtils]: 9: Hoare triple {184#false} assume 0bv32 == __VERIFIER_assert_~cond; {184#false} is VALID [2020-07-28 18:22:17,228 INFO L280 TraceCheckUtils]: 8: Hoare triple {184#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {184#false} is VALID [2020-07-28 18:22:17,228 INFO L280 TraceCheckUtils]: 7: Hoare triple {184#false} assume !~bvult32(main_~x~0, main_~y~0); {184#false} is VALID [2020-07-28 18:22:17,229 INFO L280 TraceCheckUtils]: 6: Hoare triple {184#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {184#false} is VALID [2020-07-28 18:22:17,230 INFO L280 TraceCheckUtils]: 5: Hoare triple {235#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {184#false} is VALID [2020-07-28 18:22:17,231 INFO L280 TraceCheckUtils]: 4: Hoare triple {235#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {235#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} is VALID [2020-07-28 18:22:17,232 INFO L280 TraceCheckUtils]: 3: Hoare triple {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {235#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} is VALID [2020-07-28 18:22:17,233 INFO L280 TraceCheckUtils]: 2: Hoare triple {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} assume !~bvuge32(main_~x~0, 5000000bv32); {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:17,233 INFO L280 TraceCheckUtils]: 1: Hoare triple {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:17,234 INFO L280 TraceCheckUtils]: 0: Hoare triple {183#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {242#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:17,235 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:22:17,236 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52825195] [2020-07-28 18:22:17,236 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:22:17,236 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2020-07-28 18:22:17,237 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922006940] [2020-07-28 18:22:17,237 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 18:22:17,238 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:17,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:22:17,275 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:17,276 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:22:17,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:17,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:22:17,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:22:17,277 INFO L87 Difference]: Start difference. First operand 12 states and 13 transitions. Second operand 6 states. [2020-07-28 18:22:17,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:17,471 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-28 18:22:17,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:22:17,471 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2020-07-28 18:22:17,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:17,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:22:17,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-28 18:22:17,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:22:17,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2020-07-28 18:22:17,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2020-07-28 18:22:17,564 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:17,567 INFO L225 Difference]: With dead ends: 35 [2020-07-28 18:22:17,567 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:22:17,568 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 16 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:22:17,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:22:17,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 19. [2020-07-28 18:22:17,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:17,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 19 states. [2020-07-28 18:22:17,586 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 19 states. [2020-07-28 18:22:17,586 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 19 states. [2020-07-28 18:22:17,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:17,590 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-28 18:22:17,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-28 18:22:17,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:17,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:17,592 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 28 states. [2020-07-28 18:22:17,592 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 28 states. [2020-07-28 18:22:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:17,604 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2020-07-28 18:22:17,604 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-28 18:22:17,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:17,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:17,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:17,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:17,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 18:22:17,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2020-07-28 18:22:17,612 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 11 [2020-07-28 18:22:17,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:17,613 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2020-07-28 18:22:17,614 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:22:17,614 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-28 18:22:17,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-07-28 18:22:17,615 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:17,615 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1] [2020-07-28 18:22:17,837 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2020-07-28 18:22:17,838 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:17,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:17,839 INFO L82 PathProgramCache]: Analyzing trace with hash -386546321, now seen corresponding path program 1 times [2020-07-28 18:22:17,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:17,840 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473558737] [2020-07-28 18:22:17,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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:22:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:17,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:22:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:17,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:17,950 INFO L280 TraceCheckUtils]: 0: Hoare triple {374#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,951 INFO L280 TraceCheckUtils]: 1: Hoare triple {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} assume !!~bvult32(main_~x~0, main_~y~0); {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,952 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} assume !~bvuge32(main_~x~0, 5000000bv32); {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,953 INFO L280 TraceCheckUtils]: 3: Hoare triple {379#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv0 32) ULTIMATE.start_main_~x~0))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,954 INFO L280 TraceCheckUtils]: 4: Hoare triple {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} assume !!~bvult32(main_~x~0, main_~y~0); {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,955 INFO L280 TraceCheckUtils]: 5: Hoare triple {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} assume !~bvuge32(main_~x~0, 5000000bv32); {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,956 INFO L280 TraceCheckUtils]: 6: Hoare triple {389#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv1 32) ULTIMATE.start_main_~x~0))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {399#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv2 32) ULTIMATE.start_main_~x~0))} is VALID [2020-07-28 18:22:17,957 INFO L280 TraceCheckUtils]: 7: Hoare triple {399#(and (= (_ bv10000000 32) ULTIMATE.start_main_~y~0) (= (_ bv2 32) ULTIMATE.start_main_~x~0))} assume !~bvult32(main_~x~0, main_~y~0); {375#false} is VALID [2020-07-28 18:22:17,957 INFO L280 TraceCheckUtils]: 8: Hoare triple {375#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {375#false} is VALID [2020-07-28 18:22:17,958 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#false} assume 0bv32 == __VERIFIER_assert_~cond; {375#false} is VALID [2020-07-28 18:22:17,958 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#false} assume !false; {375#false} is VALID [2020-07-28 18:22:17,959 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:22:17,959 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:18,066 INFO L280 TraceCheckUtils]: 10: Hoare triple {375#false} assume !false; {375#false} is VALID [2020-07-28 18:22:18,067 INFO L280 TraceCheckUtils]: 9: Hoare triple {375#false} assume 0bv32 == __VERIFIER_assert_~cond; {375#false} is VALID [2020-07-28 18:22:18,067 INFO L280 TraceCheckUtils]: 8: Hoare triple {375#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {375#false} is VALID [2020-07-28 18:22:18,068 INFO L280 TraceCheckUtils]: 7: Hoare triple {421#(bvult ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} assume !~bvult32(main_~x~0, main_~y~0); {375#false} is VALID [2020-07-28 18:22:18,069 INFO L280 TraceCheckUtils]: 6: Hoare triple {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {421#(bvult ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,069 INFO L280 TraceCheckUtils]: 5: Hoare triple {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,070 INFO L280 TraceCheckUtils]: 4: Hoare triple {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, main_~y~0); {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,089 INFO L280 TraceCheckUtils]: 3: Hoare triple {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {425#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,090 INFO L280 TraceCheckUtils]: 2: Hoare triple {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,091 INFO L280 TraceCheckUtils]: 1: Hoare triple {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} assume !!~bvult32(main_~x~0, main_~y~0); {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,092 INFO L280 TraceCheckUtils]: 0: Hoare triple {374#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {435#(bvult (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) ULTIMATE.start_main_~y~0)} is VALID [2020-07-28 18:22:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:22:18,094 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473558737] [2020-07-28 18:22:18,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:22:18,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2020-07-28 18:22:18,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720505946] [2020-07-28 18:22:18,095 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-28 18:22:18,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:18,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-28 18:22:18,176 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:18,176 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-28 18:22:18,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:18,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-28 18:22:18,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:22:18,178 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand 8 states. [2020-07-28 18:22:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:18,524 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-28 18:22:18,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 18:22:18,524 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 11 [2020-07-28 18:22:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:18,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:22:18,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2020-07-28 18:22:18,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-28 18:22:18,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 33 transitions. [2020-07-28 18:22:18,530 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 33 transitions. [2020-07-28 18:22:18,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:18,617 INFO L225 Difference]: With dead ends: 28 [2020-07-28 18:22:18,617 INFO L226 Difference]: Without dead ends: 24 [2020-07-28 18:22:18,618 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:22:18,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2020-07-28 18:22:18,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2020-07-28 18:22:18,631 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:18,632 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand 24 states. [2020-07-28 18:22:18,632 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 18:22:18,632 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 18:22:18,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:18,634 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:22:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:22:18,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:18,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:18,635 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 24 states. [2020-07-28 18:22:18,635 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 24 states. [2020-07-28 18:22:18,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:18,637 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2020-07-28 18:22:18,637 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:22:18,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:18,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:18,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:18,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:18,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-28 18:22:18,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2020-07-28 18:22:18,640 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 11 [2020-07-28 18:22:18,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:18,641 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2020-07-28 18:22:18,641 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-28 18:22:18,641 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2020-07-28 18:22:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:22:18,642 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:18,642 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 4, 2, 1, 1, 1, 1, 1] [2020-07-28 18:22:18,859 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2020-07-28 18:22:18,860 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:18,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:18,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1779029807, now seen corresponding path program 2 times [2020-07-28 18:22:18,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:18,863 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [39327591] [2020-07-28 18:22:18,863 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 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:22:18,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:22:18,900 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:22:18,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-28 18:22:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:18,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:18,995 INFO L280 TraceCheckUtils]: 0: Hoare triple {562#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:18,995 INFO L280 TraceCheckUtils]: 1: Hoare triple {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:18,997 INFO L280 TraceCheckUtils]: 2: Hoare triple {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:18,999 INFO L280 TraceCheckUtils]: 3: Hoare triple {567#(= (_ bv0 32) ULTIMATE.start_main_~x~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,000 INFO L280 TraceCheckUtils]: 4: Hoare triple {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,001 INFO L280 TraceCheckUtils]: 5: Hoare triple {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,002 INFO L280 TraceCheckUtils]: 6: Hoare triple {577#(= (_ bv1 32) ULTIMATE.start_main_~x~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,003 INFO L280 TraceCheckUtils]: 7: Hoare triple {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,003 INFO L280 TraceCheckUtils]: 8: Hoare triple {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,004 INFO L280 TraceCheckUtils]: 9: Hoare triple {587#(= (_ bv2 32) ULTIMATE.start_main_~x~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,005 INFO L280 TraceCheckUtils]: 10: Hoare triple {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,005 INFO L280 TraceCheckUtils]: 11: Hoare triple {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,006 INFO L280 TraceCheckUtils]: 12: Hoare triple {597#(= (_ bv3 32) ULTIMATE.start_main_~x~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {607#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,007 INFO L280 TraceCheckUtils]: 13: Hoare triple {607#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} assume !!~bvult32(main_~x~0, main_~y~0); {607#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} is VALID [2020-07-28 18:22:19,007 INFO L280 TraceCheckUtils]: 14: Hoare triple {607#(= (_ bv4 32) ULTIMATE.start_main_~x~0)} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {563#false} is VALID [2020-07-28 18:22:19,007 INFO L280 TraceCheckUtils]: 15: Hoare triple {563#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {563#false} is VALID [2020-07-28 18:22:19,008 INFO L280 TraceCheckUtils]: 16: Hoare triple {563#false} assume !!~bvult32(main_~x~0, main_~y~0); {563#false} is VALID [2020-07-28 18:22:19,008 INFO L280 TraceCheckUtils]: 17: Hoare triple {563#false} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {563#false} is VALID [2020-07-28 18:22:19,008 INFO L280 TraceCheckUtils]: 18: Hoare triple {563#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {563#false} is VALID [2020-07-28 18:22:19,008 INFO L280 TraceCheckUtils]: 19: Hoare triple {563#false} assume !~bvult32(main_~x~0, main_~y~0); {563#false} is VALID [2020-07-28 18:22:19,009 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {563#false} is VALID [2020-07-28 18:22:19,009 INFO L280 TraceCheckUtils]: 21: Hoare triple {563#false} assume 0bv32 == __VERIFIER_assert_~cond; {563#false} is VALID [2020-07-28 18:22:19,009 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-28 18:22:19,010 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:22:19,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:19,267 INFO L280 TraceCheckUtils]: 22: Hoare triple {563#false} assume !false; {563#false} is VALID [2020-07-28 18:22:19,267 INFO L280 TraceCheckUtils]: 21: Hoare triple {563#false} assume 0bv32 == __VERIFIER_assert_~cond; {563#false} is VALID [2020-07-28 18:22:19,267 INFO L280 TraceCheckUtils]: 20: Hoare triple {563#false} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {563#false} is VALID [2020-07-28 18:22:19,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {563#false} assume !~bvult32(main_~x~0, main_~y~0); {563#false} is VALID [2020-07-28 18:22:19,268 INFO L280 TraceCheckUtils]: 18: Hoare triple {563#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {563#false} is VALID [2020-07-28 18:22:19,269 INFO L280 TraceCheckUtils]: 17: Hoare triple {563#false} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {563#false} is VALID [2020-07-28 18:22:19,269 INFO L280 TraceCheckUtils]: 16: Hoare triple {563#false} assume !!~bvult32(main_~x~0, main_~y~0); {563#false} is VALID [2020-07-28 18:22:19,269 INFO L280 TraceCheckUtils]: 15: Hoare triple {563#false} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {563#false} is VALID [2020-07-28 18:22:19,270 INFO L280 TraceCheckUtils]: 14: Hoare triple {662#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} assume ~bvuge32(main_~x~0, 5000000bv32);main_~z~0 := ~bvadd32(2bv32, main_~z~0); {563#false} is VALID [2020-07-28 18:22:19,271 INFO L280 TraceCheckUtils]: 13: Hoare triple {662#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {662#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,273 INFO L280 TraceCheckUtils]: 12: Hoare triple {669#(forall ((v_ULTIMATE.start_main_~x~0_23 (_ BitVec 32))) (or (not (= (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) v_ULTIMATE.start_main_~x~0_23)) (not (bvuge v_ULTIMATE.start_main_~x~0_23 (_ bv5000000 32)))))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {662#(not (bvuge ULTIMATE.start_main_~x~0 (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,278 INFO L280 TraceCheckUtils]: 11: Hoare triple {673#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} assume !~bvuge32(main_~x~0, 5000000bv32); {669#(forall ((v_ULTIMATE.start_main_~x~0_23 (_ BitVec 32))) (or (not (= (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) v_ULTIMATE.start_main_~x~0_23)) (not (bvuge v_ULTIMATE.start_main_~x~0_23 (_ bv5000000 32)))))} is VALID [2020-07-28 18:22:19,279 INFO L280 TraceCheckUtils]: 10: Hoare triple {673#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {673#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,285 INFO L280 TraceCheckUtils]: 9: Hoare triple {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {673#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv1 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,285 INFO L280 TraceCheckUtils]: 8: Hoare triple {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} assume !~bvuge32(main_~x~0, 5000000bv32); {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,286 INFO L280 TraceCheckUtils]: 7: Hoare triple {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,294 INFO L280 TraceCheckUtils]: 6: Hoare triple {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {680#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv2 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,294 INFO L280 TraceCheckUtils]: 5: Hoare triple {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} assume !~bvuge32(main_~x~0, 5000000bv32); {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,295 INFO L280 TraceCheckUtils]: 4: Hoare triple {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,300 INFO L280 TraceCheckUtils]: 3: Hoare triple {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {690#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv3 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,304 INFO L280 TraceCheckUtils]: 2: Hoare triple {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} assume !~bvuge32(main_~x~0, 5000000bv32); {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,309 INFO L280 TraceCheckUtils]: 1: Hoare triple {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} assume !!~bvult32(main_~x~0, main_~y~0); {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,310 INFO L280 TraceCheckUtils]: 0: Hoare triple {562#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {700#(not (bvuge (bvadd ULTIMATE.start_main_~x~0 (_ bv4 32)) (_ bv5000000 32)))} is VALID [2020-07-28 18:22:19,312 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 23 proven. 26 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 18:22:19,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [39327591] [2020-07-28 18:22:19,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:22:19,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 12 [2020-07-28 18:22:19,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654055398] [2020-07-28 18:22:19,314 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-07-28 18:22:19,314 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:19,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-28 18:22:19,410 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:19,410 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-28 18:22:19,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:19,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-28 18:22:19,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2020-07-28 18:22:19,411 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 13 states. [2020-07-28 18:22:20,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:20,409 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2020-07-28 18:22:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-28 18:22:20,409 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 23 [2020-07-28 18:22:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:20,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:22:20,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-28 18:22:20,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-28 18:22:20,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 69 transitions. [2020-07-28 18:22:20,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 69 transitions. [2020-07-28 18:22:20,563 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:20,565 INFO L225 Difference]: With dead ends: 63 [2020-07-28 18:22:20,566 INFO L226 Difference]: Without dead ends: 54 [2020-07-28 18:22:20,566 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2020-07-28 18:22:20,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2020-07-28 18:22:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 37. [2020-07-28 18:22:20,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:20,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand 37 states. [2020-07-28 18:22:20,582 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand 37 states. [2020-07-28 18:22:20,582 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 37 states. [2020-07-28 18:22:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:20,585 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-28 18:22:20,585 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-28 18:22:20,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:20,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:20,586 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 54 states. [2020-07-28 18:22:20,586 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 54 states. [2020-07-28 18:22:20,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:20,589 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2020-07-28 18:22:20,589 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2020-07-28 18:22:20,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:20,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:20,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:20,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:20,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-28 18:22:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2020-07-28 18:22:20,592 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 23 [2020-07-28 18:22:20,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:20,593 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2020-07-28 18:22:20,593 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-28 18:22:20,593 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2020-07-28 18:22:20,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:22:20,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:22:20,594 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1] [2020-07-28 18:22:20,813 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2020-07-28 18:22:20,814 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:22:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:22:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1778620817, now seen corresponding path program 2 times [2020-07-28 18:22:20,816 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2020-07-28 18:22:20,816 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [940160962] [2020-07-28 18:22:20,817 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 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2020-07-28 18:22:20,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2020-07-28 18:22:20,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:22:20,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-28 18:22:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:22:20,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:22:20,875 INFO L280 TraceCheckUtils]: 0: Hoare triple {949#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,876 INFO L280 TraceCheckUtils]: 1: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,877 INFO L280 TraceCheckUtils]: 2: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,877 INFO L280 TraceCheckUtils]: 3: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,878 INFO L280 TraceCheckUtils]: 4: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,882 INFO L280 TraceCheckUtils]: 5: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,883 INFO L280 TraceCheckUtils]: 6: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,883 INFO L280 TraceCheckUtils]: 7: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,884 INFO L280 TraceCheckUtils]: 8: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,884 INFO L280 TraceCheckUtils]: 9: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,892 INFO L280 TraceCheckUtils]: 10: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,893 INFO L280 TraceCheckUtils]: 11: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,894 INFO L280 TraceCheckUtils]: 12: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,894 INFO L280 TraceCheckUtils]: 13: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,895 INFO L280 TraceCheckUtils]: 14: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,896 INFO L280 TraceCheckUtils]: 15: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,896 INFO L280 TraceCheckUtils]: 16: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !!~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,897 INFO L280 TraceCheckUtils]: 17: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvuge32(main_~x~0, 5000000bv32); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,897 INFO L280 TraceCheckUtils]: 18: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,898 INFO L280 TraceCheckUtils]: 19: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} assume !~bvult32(main_~x~0, main_~y~0); {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} is VALID [2020-07-28 18:22:20,899 INFO L280 TraceCheckUtils]: 20: Hoare triple {954#(= (_ bv0 32) ULTIMATE.start_main_~z~0)} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1015#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,899 INFO L280 TraceCheckUtils]: 21: Hoare triple {1015#(= (bvadd ULTIMATE.start___VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == __VERIFIER_assert_~cond; {950#false} is VALID [2020-07-28 18:22:20,900 INFO L280 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2020-07-28 18:22:20,901 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-07-28 18:22:20,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2020-07-28 18:22:20,959 INFO L280 TraceCheckUtils]: 22: Hoare triple {950#false} assume !false; {950#false} is VALID [2020-07-28 18:22:20,960 INFO L280 TraceCheckUtils]: 21: Hoare triple {1025#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == __VERIFIER_assert_~cond; {950#false} is VALID [2020-07-28 18:22:20,961 INFO L280 TraceCheckUtils]: 20: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} __VERIFIER_assert_#in~cond := (if 0bv32 == ~bvurem32(main_~z~0, 2bv32) then 1bv32 else 0bv32);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; {1025#(not (= ULTIMATE.start___VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2020-07-28 18:22:20,962 INFO L280 TraceCheckUtils]: 19: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,962 INFO L280 TraceCheckUtils]: 18: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,967 INFO L280 TraceCheckUtils]: 17: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,968 INFO L280 TraceCheckUtils]: 16: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,969 INFO L280 TraceCheckUtils]: 15: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,970 INFO L280 TraceCheckUtils]: 14: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,970 INFO L280 TraceCheckUtils]: 13: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,971 INFO L280 TraceCheckUtils]: 12: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,972 INFO L280 TraceCheckUtils]: 11: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,972 INFO L280 TraceCheckUtils]: 10: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,973 INFO L280 TraceCheckUtils]: 9: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,974 INFO L280 TraceCheckUtils]: 8: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,974 INFO L280 TraceCheckUtils]: 7: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,975 INFO L280 TraceCheckUtils]: 6: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,975 INFO L280 TraceCheckUtils]: 5: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,976 INFO L280 TraceCheckUtils]: 4: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,977 INFO L280 TraceCheckUtils]: 3: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} main_#t~post0 := main_~x~0;main_~x~0 := ~bvadd32(1bv32, main_#t~post0);havoc main_#t~post0; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !~bvuge32(main_~x~0, 5000000bv32); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,978 INFO L280 TraceCheckUtils]: 1: Hoare triple {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} assume !!~bvult32(main_~x~0, main_~y~0); {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,979 INFO L280 TraceCheckUtils]: 0: Hoare triple {949#true} havoc main_#res;havoc main_#t~post0, main_~x~0, main_~y~0, main_~z~0;main_~x~0 := 0bv32;main_~y~0 := 10000000bv32;main_~z~0 := 0bv32; {1029#(= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32))} is VALID [2020-07-28 18:22:20,982 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2020-07-28 18:22:20,982 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [940160962] [2020-07-28 18:22:20,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:22:20,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 5 [2020-07-28 18:22:20,983 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985538895] [2020-07-28 18:22:20,983 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-28 18:22:20,984 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:22:20,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:22:21,002 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:22:21,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:22:21,003 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2020-07-28 18:22:21,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:22:21,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:22:21,004 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand 6 states. [2020-07-28 18:22:21,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:21,101 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2020-07-28 18:22:21,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:22:21,102 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2020-07-28 18:22:21,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:22:21,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:22:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-28 18:22:21,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:22:21,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2020-07-28 18:22:21,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 16 transitions. [2020-07-28 18:22:21,127 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:22:21,127 INFO L225 Difference]: With dead ends: 42 [2020-07-28 18:22:21,127 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:22:21,129 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:22:21,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:22:21,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:22:21,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:22:21,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:22:21,130 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:22:21,130 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:22:21,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:21,130 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:22:21,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:22:21,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:21,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:21,131 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:22:21,131 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:22:21,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:22:21,131 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:22:21,131 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:22:21,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:21,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:22:21,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:22:21,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:22:21,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:22:21,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:22:21,132 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-28 18:22:21,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:22:21,132 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:22:21,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:22:21,132 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:22:21,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:22:21,340 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2020-07-28 18:22:21,343 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point L2-1(line 2) no Hoare annotation was computed. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point L2-3(line 2) no Hoare annotation was computed. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point L9(lines 9 10) no Hoare annotation was computed. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point L9-2(lines 9 10) no Hoare annotation was computed. [2020-07-28 18:22:21,418 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:22:21,419 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:22:21,419 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 2) no Hoare annotation was computed. [2020-07-28 18:22:21,419 INFO L271 CegarLoopResult]: At program point L14(lines 4 15) the Hoare annotation is: true [2020-07-28 18:22:21,419 INFO L264 CegarLoopResult]: At program point L8-2(lines 8 12) the Hoare annotation is: (= (bvurem ULTIMATE.start_main_~z~0 (_ bv2 32)) (_ bv0 32)) [2020-07-28 18:22:21,419 INFO L268 CegarLoopResult]: For program point L8-3(lines 8 12) no Hoare annotation was computed. [2020-07-28 18:22:21,419 INFO L268 CegarLoopResult]: For program point L2(line 2) no Hoare annotation was computed. [2020-07-28 18:22:21,424 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:22:21,424 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:22:21,424 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:22:21,424 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 18:22:21,424 WARN L170 areAnnotationChecker]: L8-3 has no Hoare annotation [2020-07-28 18:22:21,425 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 18:22:21,425 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2020-07-28 18:22:21,425 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-28 18:22:21,425 WARN L170 areAnnotationChecker]: L2 has no Hoare annotation [2020-07-28 18:22:21,425 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2020-07-28 18:22:21,426 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-28 18:22:21,426 WARN L170 areAnnotationChecker]: L2-1 has no Hoare annotation [2020-07-28 18:22:21,426 WARN L170 areAnnotationChecker]: L2-3 has no Hoare annotation [2020-07-28 18:22:21,426 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:22:21,426 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:22:21,427 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:22:21,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:22:21 BoogieIcfgContainer [2020-07-28 18:22:21,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:22:21,439 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:22:21,439 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:22:21,439 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:22:21,440 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:22:15" (3/4) ... [2020-07-28 18:22:21,444 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:22:21,455 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2020-07-28 18:22:21,455 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:22:21,526 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:22:21,526 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:22:21,529 INFO L168 Benchmark]: Toolchain (without parser) took 6343.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 203.9 MB). Free memory was 961.6 MB in the beginning and 1.1 GB in the end (delta: -139.5 MB). Peak memory consumption was 64.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,530 INFO L168 Benchmark]: CDTParser took 0.27 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:22:21,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 253.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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:22:21,531 INFO L168 Benchmark]: Boogie Procedure Inliner took 98.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,531 INFO L168 Benchmark]: Boogie Preprocessor took 22.27 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,532 INFO L168 Benchmark]: RCFGBuilder took 294.04 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,538 INFO L168 Benchmark]: TraceAbstraction took 5580.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,539 INFO L168 Benchmark]: Witness Printer took 86.99 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2020-07-28 18:22:21,542 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.27 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 253.11 ms. Allocated memory is still 1.0 GB. Free memory was 961.6 MB in the beginning and 950.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 98.80 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -191.1 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.27 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.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 294.04 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: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5580.97 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 58.7 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.3 MB). Peak memory consumption was 66.0 MB. Max. memory is 11.5 GB. * Witness Printer took 86.99 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: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 2]: 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: 8]: Loop Invariant Derived loop invariant: ~bvurem32(z, 2bv32) == 0bv32 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 12 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 5.3s, OverallIterations: 6, TraceHistogramMax: 6, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 38 SDtfs, 110 SDslu, 63 SDs, 0 SdLazy, 195 SolverSat, 34 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 26 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 15 NumberOfFragments, 6 HoareAnnotationTreeSize, 2 FomulaSimplifications, 155 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 4 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 78 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 144 ConstructedInterpolants, 1 QuantifiedInterpolants, 8416 SizeOfPredicates, 9 NumberOfNonLiveVariables, 93 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 158/224 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...