./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_b3_o5-2.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/recursive-simple/id_b3_o5-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d39666f7b9e3c393826226f879477647e7209cc ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 19:11:35,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 19:11:35,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 19:11:35,646 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 19:11:35,647 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 19:11:35,649 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 19:11:35,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 19:11:35,663 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 19:11:35,665 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 19:11:35,666 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 19:11:35,668 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 19:11:35,670 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 19:11:35,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 19:11:35,675 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 19:11:35,676 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 19:11:35,678 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 19:11:35,679 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 19:11:35,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 19:11:35,684 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 19:11:35,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 19:11:35,695 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 19:11:35,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 19:11:35,702 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 19:11:35,703 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 19:11:35,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 19:11:35,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 19:11:35,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 19:11:35,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 19:11:35,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 19:11:35,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 19:11:35,710 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 19:11:35,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 19:11:35,712 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 19:11:35,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 19:11:35,715 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 19:11:35,715 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 19:11:35,716 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 19:11:35,716 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 19:11:35,716 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 19:11:35,717 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 19:11:35,719 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 19:11:35,719 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 19:11:35,759 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 19:11:35,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 19:11:35,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 19:11:35,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 19:11:35,763 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 19:11:35,763 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 19:11:35,763 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 19:11:35,763 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 19:11:35,764 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 19:11:35,764 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 19:11:35,764 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 19:11:35,764 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 19:11:35,764 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 19:11:35,765 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 19:11:35,765 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 19:11:35,765 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 19:11:35,768 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 19:11:35,769 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 19:11:35,769 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 19:11:35,769 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 19:11:35,769 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 19:11:35,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 19:11:35,770 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 19:11:35,770 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 19:11:35,770 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 19:11:35,771 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 19:11:35,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 19:11:35,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 19:11:35,771 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 19:11:35,772 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 -> 8d39666f7b9e3c393826226f879477647e7209cc [2020-07-28 19:11:36,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 19:11:36,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 19:11:36,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 19:11:36,123 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 19:11:36,124 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 19:11:36,125 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_b3_o5-2.c [2020-07-28 19:11:36,198 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa250afa/2419692775664fadaa4670136a27b3c5/FLAG473882218 [2020-07-28 19:11:36,670 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 19:11:36,671 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_b3_o5-2.c [2020-07-28 19:11:36,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa250afa/2419692775664fadaa4670136a27b3c5/FLAG473882218 [2020-07-28 19:11:37,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaa250afa/2419692775664fadaa4670136a27b3c5 [2020-07-28 19:11:37,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 19:11:37,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 19:11:37,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 19:11:37,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 19:11:37,038 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 19:11:37,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,043 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cab78e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37, skipping insertion in model container [2020-07-28 19:11:37,043 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,051 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 19:11:37,068 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 19:11:37,243 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:11:37,248 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 19:11:37,264 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 19:11:37,283 INFO L208 MainTranslator]: Completed translation [2020-07-28 19:11:37,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37 WrapperNode [2020-07-28 19:11:37,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 19:11:37,287 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 19:11:37,287 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 19:11:37,288 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 19:11:37,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,301 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,320 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 19:11:37,320 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 19:11:37,320 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 19:11:37,320 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 19:11:37,390 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,397 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,398 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (1/1) ... [2020-07-28 19:11:37,399 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 19:11:37,400 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 19:11:37,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 19:11:37,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 19:11:37,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (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 19:11:37,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 19:11:37,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 19:11:37,472 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-28 19:11:37,472 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-28 19:11:37,743 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 19:11:37,744 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 19:11:37,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:37 BoogieIcfgContainer [2020-07-28 19:11:37,762 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 19:11:37,766 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 19:11:37,766 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 19:11:37,770 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 19:11:37,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 07:11:37" (1/3) ... [2020-07-28 19:11:37,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609bb95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:11:37, skipping insertion in model container [2020-07-28 19:11:37,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 07:11:37" (2/3) ... [2020-07-28 19:11:37,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@609bb95f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 07:11:37, skipping insertion in model container [2020-07-28 19:11:37,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:37" (3/3) ... [2020-07-28 19:11:37,786 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b3_o5-2.c [2020-07-28 19:11:37,800 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 19:11:37,807 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 19:11:37,823 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 19:11:37,846 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 19:11:37,847 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 19:11:37,847 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 19:11:37,847 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 19:11:37,848 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 19:11:37,848 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 19:11:37,848 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 19:11:37,848 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 19:11:37,864 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states. [2020-07-28 19:11:37,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 19:11:37,871 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:37,872 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:37,872 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:37,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:37,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1224902363, now seen corresponding path program 1 times [2020-07-28 19:11:37,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:37,891 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546464877] [2020-07-28 19:11:37,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,110 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2020-07-28 19:11:38,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:38,149 INFO L280 TraceCheckUtils]: 2: Hoare triple {27#(<= |id_#res| 0)} assume true; {27#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:38,151 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {27#(<= |id_#res| 0)} {19#true} #28#return; {25#(<= |ULTIMATE.start_main_#t~ret2| 0)} is VALID [2020-07-28 19:11:38,154 INFO L280 TraceCheckUtils]: 0: Hoare triple {19#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {19#true} is VALID [2020-07-28 19:11:38,155 INFO L263 TraceCheckUtils]: 1: Hoare triple {19#true} call main_#t~ret2 := id(main_~input~0); {19#true} is VALID [2020-07-28 19:11:38,155 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} ~x := #in~x; {19#true} is VALID [2020-07-28 19:11:38,162 INFO L280 TraceCheckUtils]: 3: Hoare triple {19#true} assume 0 == ~x;#res := 0; {27#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:38,163 INFO L280 TraceCheckUtils]: 4: Hoare triple {27#(<= |id_#res| 0)} assume true; {27#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:38,166 INFO L275 TraceCheckUtils]: 5: Hoare quadruple {27#(<= |id_#res| 0)} {19#true} #28#return; {25#(<= |ULTIMATE.start_main_#t~ret2| 0)} is VALID [2020-07-28 19:11:38,167 INFO L280 TraceCheckUtils]: 6: Hoare triple {25#(<= |ULTIMATE.start_main_#t~ret2| 0)} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {26#(<= ULTIMATE.start_main_~result~0 0)} is VALID [2020-07-28 19:11:38,169 INFO L280 TraceCheckUtils]: 7: Hoare triple {26#(<= ULTIMATE.start_main_~result~0 0)} assume 5 == main_~result~0; {20#false} is VALID [2020-07-28 19:11:38,169 INFO L280 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2020-07-28 19:11:38,170 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 19:11:38,171 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546464877] [2020-07-28 19:11:38,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:11:38,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:11:38,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036097495] [2020-07-28 19:11:38,180 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:11:38,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:38,188 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:11:38,216 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:38,216 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:11:38,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:38,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:11:38,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:38,226 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 5 states. [2020-07-28 19:11:38,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,368 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2020-07-28 19:11:38,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:11:38,369 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 9 [2020-07-28 19:11:38,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:38,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:38,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 19:11:38,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:38,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-07-28 19:11:38,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 31 transitions. [2020-07-28 19:11:38,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:38,446 INFO L225 Difference]: With dead ends: 28 [2020-07-28 19:11:38,446 INFO L226 Difference]: Without dead ends: 15 [2020-07-28 19:11:38,450 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:38,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-28 19:11:38,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-28 19:11:38,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:38,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-28 19:11:38,511 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 19:11:38,511 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 19:11:38,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,518 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 19:11:38,519 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 19:11:38,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,522 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-28 19:11:38,522 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-28 19:11:38,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,531 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2020-07-28 19:11:38,531 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 19:11:38,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:38,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:38,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-28 19:11:38,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2020-07-28 19:11:38,539 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2020-07-28 19:11:38,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:38,539 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2020-07-28 19:11:38,540 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:11:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2020-07-28 19:11:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 19:11:38,542 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:38,543 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:38,543 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 19:11:38,544 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:38,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:38,544 INFO L82 PathProgramCache]: Analyzing trace with hash 510739163, now seen corresponding path program 1 times [2020-07-28 19:11:38,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:38,546 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79070182] [2020-07-28 19:11:38,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,664 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,717 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:38,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:38,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {109#true} is VALID [2020-07-28 19:11:38,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {109#true} assume 0 == ~x;#res := 0; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,771 INFO L280 TraceCheckUtils]: 2: Hoare triple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,773 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {109#true} #30#return; {126#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:38,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#true} ~x := #in~x; {109#true} is VALID [2020-07-28 19:11:38,774 INFO L280 TraceCheckUtils]: 1: Hoare triple {109#true} assume !(0 == ~x); {109#true} is VALID [2020-07-28 19:11:38,774 INFO L263 TraceCheckUtils]: 2: Hoare triple {109#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {109#true} is VALID [2020-07-28 19:11:38,775 INFO L280 TraceCheckUtils]: 3: Hoare triple {109#true} ~x := #in~x; {109#true} is VALID [2020-07-28 19:11:38,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {109#true} assume 0 == ~x;#res := 0; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,777 INFO L280 TraceCheckUtils]: 5: Hoare triple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,779 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {109#true} #30#return; {126#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:38,780 INFO L280 TraceCheckUtils]: 7: Hoare triple {126#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {127#(<= id_~ret~0 1)} is VALID [2020-07-28 19:11:38,781 INFO L280 TraceCheckUtils]: 8: Hoare triple {127#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {110#false} is VALID [2020-07-28 19:11:38,782 INFO L280 TraceCheckUtils]: 9: Hoare triple {110#false} assume true; {110#false} is VALID [2020-07-28 19:11:38,782 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {110#false} {109#true} #28#return; {110#false} is VALID [2020-07-28 19:11:38,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {109#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {109#true} is VALID [2020-07-28 19:11:38,784 INFO L263 TraceCheckUtils]: 1: Hoare triple {109#true} call main_#t~ret2 := id(main_~input~0); {109#true} is VALID [2020-07-28 19:11:38,784 INFO L280 TraceCheckUtils]: 2: Hoare triple {109#true} ~x := #in~x; {109#true} is VALID [2020-07-28 19:11:38,784 INFO L280 TraceCheckUtils]: 3: Hoare triple {109#true} assume !(0 == ~x); {109#true} is VALID [2020-07-28 19:11:38,785 INFO L263 TraceCheckUtils]: 4: Hoare triple {109#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {109#true} is VALID [2020-07-28 19:11:38,785 INFO L280 TraceCheckUtils]: 5: Hoare triple {109#true} ~x := #in~x; {109#true} is VALID [2020-07-28 19:11:38,786 INFO L280 TraceCheckUtils]: 6: Hoare triple {109#true} assume 0 == ~x;#res := 0; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,787 INFO L280 TraceCheckUtils]: 7: Hoare triple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:38,789 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {128#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {109#true} #30#return; {126#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:38,791 INFO L280 TraceCheckUtils]: 9: Hoare triple {126#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {127#(<= id_~ret~0 1)} is VALID [2020-07-28 19:11:38,792 INFO L280 TraceCheckUtils]: 10: Hoare triple {127#(<= id_~ret~0 1)} assume ~ret~0 > 3;#res := 3; {110#false} is VALID [2020-07-28 19:11:38,792 INFO L280 TraceCheckUtils]: 11: Hoare triple {110#false} assume true; {110#false} is VALID [2020-07-28 19:11:38,792 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {110#false} {109#true} #28#return; {110#false} is VALID [2020-07-28 19:11:38,793 INFO L280 TraceCheckUtils]: 13: Hoare triple {110#false} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {110#false} is VALID [2020-07-28 19:11:38,793 INFO L280 TraceCheckUtils]: 14: Hoare triple {110#false} assume 5 == main_~result~0; {110#false} is VALID [2020-07-28 19:11:38,793 INFO L280 TraceCheckUtils]: 15: Hoare triple {110#false} assume !false; {110#false} is VALID [2020-07-28 19:11:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:11:38,796 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79070182] [2020-07-28 19:11:38,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:11:38,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:11:38,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754805509] [2020-07-28 19:11:38,798 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 19:11:38,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:38,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:11:38,825 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 19:11:38,825 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:11:38,825 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:38,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:11:38,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:38,826 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 5 states. [2020-07-28 19:11:38,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,916 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-28 19:11:38,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:11:38,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-07-28 19:11:38,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:38,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:38,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 19:11:38,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:38,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2020-07-28 19:11:38,924 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2020-07-28 19:11:38,972 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:38,974 INFO L225 Difference]: With dead ends: 27 [2020-07-28 19:11:38,975 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 19:11:38,976 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:38,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 19:11:38,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2020-07-28 19:11:38,982 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:38,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 17 states. [2020-07-28 19:11:38,982 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 17 states. [2020-07-28 19:11:38,983 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 17 states. [2020-07-28 19:11:38,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,986 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-28 19:11:38,986 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-28 19:11:38,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,987 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand 19 states. [2020-07-28 19:11:38,987 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 19 states. [2020-07-28 19:11:38,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:38,990 INFO L93 Difference]: Finished difference Result 19 states and 22 transitions. [2020-07-28 19:11:38,991 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2020-07-28 19:11:38,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:38,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:38,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:38,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:38,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2020-07-28 19:11:38,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2020-07-28 19:11:38,995 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 16 [2020-07-28 19:11:38,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:38,995 INFO L479 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2020-07-28 19:11:38,995 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:11:38,995 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2020-07-28 19:11:38,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-28 19:11:38,996 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:38,997 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:38,997 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 19:11:38,997 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:38,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:38,998 INFO L82 PathProgramCache]: Analyzing trace with hash 539368314, now seen corresponding path program 1 times [2020-07-28 19:11:38,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:39,001 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033485665] [2020-07-28 19:11:39,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:39,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:39,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:39,171 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:39,246 INFO L280 TraceCheckUtils]: 0: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,247 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} assume 0 == ~x;#res := 0; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,248 INFO L280 TraceCheckUtils]: 2: Hoare triple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,250 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {219#true} #30#return; {238#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:39,250 INFO L280 TraceCheckUtils]: 0: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,251 INFO L280 TraceCheckUtils]: 1: Hoare triple {219#true} assume !(0 == ~x); {219#true} is VALID [2020-07-28 19:11:39,251 INFO L263 TraceCheckUtils]: 2: Hoare triple {219#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {219#true} is VALID [2020-07-28 19:11:39,251 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,252 INFO L280 TraceCheckUtils]: 4: Hoare triple {219#true} assume 0 == ~x;#res := 0; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,253 INFO L280 TraceCheckUtils]: 5: Hoare triple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,255 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {219#true} #30#return; {238#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:39,257 INFO L280 TraceCheckUtils]: 7: Hoare triple {238#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {239#(<= id_~ret~0 1)} is VALID [2020-07-28 19:11:39,258 INFO L280 TraceCheckUtils]: 8: Hoare triple {239#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,259 INFO L280 TraceCheckUtils]: 9: Hoare triple {240#(<= |id_#res| 1)} assume true; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,261 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {240#(<= |id_#res| 1)} {219#true} #28#return; {232#(<= |ULTIMATE.start_main_#t~ret2| 1)} is VALID [2020-07-28 19:11:39,261 INFO L280 TraceCheckUtils]: 0: Hoare triple {219#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {219#true} is VALID [2020-07-28 19:11:39,262 INFO L263 TraceCheckUtils]: 1: Hoare triple {219#true} call main_#t~ret2 := id(main_~input~0); {219#true} is VALID [2020-07-28 19:11:39,262 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,262 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} assume !(0 == ~x); {219#true} is VALID [2020-07-28 19:11:39,263 INFO L263 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {219#true} is VALID [2020-07-28 19:11:39,263 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} assume 0 == ~x;#res := 0; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,266 INFO L280 TraceCheckUtils]: 7: Hoare triple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-28 19:11:39,268 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {241#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {219#true} #30#return; {238#(= 0 |id_#t~ret0|)} is VALID [2020-07-28 19:11:39,270 INFO L280 TraceCheckUtils]: 9: Hoare triple {238#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {239#(<= id_~ret~0 1)} is VALID [2020-07-28 19:11:39,272 INFO L280 TraceCheckUtils]: 10: Hoare triple {239#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,273 INFO L280 TraceCheckUtils]: 11: Hoare triple {240#(<= |id_#res| 1)} assume true; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,275 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {240#(<= |id_#res| 1)} {219#true} #28#return; {232#(<= |ULTIMATE.start_main_#t~ret2| 1)} is VALID [2020-07-28 19:11:39,276 INFO L280 TraceCheckUtils]: 13: Hoare triple {232#(<= |ULTIMATE.start_main_#t~ret2| 1)} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {233#(<= ULTIMATE.start_main_~result~0 1)} is VALID [2020-07-28 19:11:39,277 INFO L280 TraceCheckUtils]: 14: Hoare triple {233#(<= ULTIMATE.start_main_~result~0 1)} assume 5 == main_~result~0; {220#false} is VALID [2020-07-28 19:11:39,278 INFO L280 TraceCheckUtils]: 15: Hoare triple {220#false} assume !false; {220#false} is VALID [2020-07-28 19:11:39,279 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:11:39,279 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033485665] [2020-07-28 19:11:39,280 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [444703170] [2020-07-28 19:11:39,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 19:11:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:39,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 19:11:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:39,330 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 19:11:39,596 INFO L280 TraceCheckUtils]: 0: Hoare triple {219#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {219#true} is VALID [2020-07-28 19:11:39,596 INFO L263 TraceCheckUtils]: 1: Hoare triple {219#true} call main_#t~ret2 := id(main_~input~0); {219#true} is VALID [2020-07-28 19:11:39,596 INFO L280 TraceCheckUtils]: 2: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,597 INFO L280 TraceCheckUtils]: 3: Hoare triple {219#true} assume !(0 == ~x); {219#true} is VALID [2020-07-28 19:11:39,597 INFO L263 TraceCheckUtils]: 4: Hoare triple {219#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {219#true} is VALID [2020-07-28 19:11:39,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {219#true} ~x := #in~x; {219#true} is VALID [2020-07-28 19:11:39,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {219#true} assume 0 == ~x;#res := 0; {263#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:39,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {263#(<= |id_#res| 0)} assume true; {263#(<= |id_#res| 0)} is VALID [2020-07-28 19:11:39,601 INFO L275 TraceCheckUtils]: 8: Hoare quadruple {263#(<= |id_#res| 0)} {219#true} #30#return; {270#(<= |id_#t~ret0| 0)} is VALID [2020-07-28 19:11:39,603 INFO L280 TraceCheckUtils]: 9: Hoare triple {270#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {239#(<= id_~ret~0 1)} is VALID [2020-07-28 19:11:39,604 INFO L280 TraceCheckUtils]: 10: Hoare triple {239#(<= id_~ret~0 1)} assume !(~ret~0 > 3);#res := ~ret~0; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,605 INFO L280 TraceCheckUtils]: 11: Hoare triple {240#(<= |id_#res| 1)} assume true; {240#(<= |id_#res| 1)} is VALID [2020-07-28 19:11:39,606 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {240#(<= |id_#res| 1)} {219#true} #28#return; {232#(<= |ULTIMATE.start_main_#t~ret2| 1)} is VALID [2020-07-28 19:11:39,607 INFO L280 TraceCheckUtils]: 13: Hoare triple {232#(<= |ULTIMATE.start_main_#t~ret2| 1)} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {233#(<= ULTIMATE.start_main_~result~0 1)} is VALID [2020-07-28 19:11:39,609 INFO L280 TraceCheckUtils]: 14: Hoare triple {233#(<= ULTIMATE.start_main_~result~0 1)} assume 5 == main_~result~0; {220#false} is VALID [2020-07-28 19:11:39,609 INFO L280 TraceCheckUtils]: 15: Hoare triple {220#false} assume !false; {220#false} is VALID [2020-07-28 19:11:39,610 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 19:11:39,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 19:11:39,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-28 19:11:39,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728107955] [2020-07-28 19:11:39,612 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-28 19:11:39,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:39,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-28 19:11:39,639 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 19:11:39,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-28 19:11:39,640 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:39,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-28 19:11:39,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-28 19:11:39,640 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand 10 states. [2020-07-28 19:11:39,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,825 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-28 19:11:39,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-28 19:11:39,825 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 16 [2020-07-28 19:11:39,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:39,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:11:39,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-28 19:11:39,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 19:11:39,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 25 transitions. [2020-07-28 19:11:39,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 25 transitions. [2020-07-28 19:11:39,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 19:11:39,870 INFO L225 Difference]: With dead ends: 23 [2020-07-28 19:11:39,870 INFO L226 Difference]: Without dead ends: 19 [2020-07-28 19:11:39,871 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-28 19:11:39,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-28 19:11:39,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-28 19:11:39,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:39,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-28 19:11:39,877 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 19:11:39,877 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 19:11:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,880 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-28 19:11:39,880 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 19:11:39,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:39,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:39,881 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-28 19:11:39,881 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-28 19:11:39,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:39,884 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-28 19:11:39,884 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 19:11:39,884 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:39,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:39,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:39,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-28 19:11:39,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-28 19:11:39,888 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 16 [2020-07-28 19:11:39,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:39,888 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-28 19:11:39,888 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-28 19:11:39,889 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-28 19:11:39,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 19:11:39,890 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 19:11:39,890 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 19:11:40,103 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 19:11:40,105 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 19:11:40,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 19:11:40,106 INFO L82 PathProgramCache]: Analyzing trace with hash -747825770, now seen corresponding path program 1 times [2020-07-28 19:11:40,106 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 19:11:40,107 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656257814] [2020-07-28 19:11:40,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 19:11:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,179 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2020-07-28 19:11:40,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,215 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,223 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2020-07-28 19:11:40,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 19:11:40,229 INFO L280 TraceCheckUtils]: 0: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,230 INFO L280 TraceCheckUtils]: 1: Hoare triple {379#true} assume 0 == ~x;#res := 0; {379#true} is VALID [2020-07-28 19:11:40,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,230 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,231 INFO L280 TraceCheckUtils]: 0: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {379#true} assume !(0 == ~x); {379#true} is VALID [2020-07-28 19:11:40,231 INFO L263 TraceCheckUtils]: 2: Hoare triple {379#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {379#true} is VALID [2020-07-28 19:11:40,232 INFO L280 TraceCheckUtils]: 3: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {379#true} assume 0 == ~x;#res := 0; {379#true} is VALID [2020-07-28 19:11:40,233 INFO L280 TraceCheckUtils]: 5: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,233 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,233 INFO L280 TraceCheckUtils]: 7: Hoare triple {379#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {379#true} is VALID [2020-07-28 19:11:40,234 INFO L280 TraceCheckUtils]: 8: Hoare triple {379#true} assume !(~ret~0 > 3);#res := ~ret~0; {379#true} is VALID [2020-07-28 19:11:40,234 INFO L280 TraceCheckUtils]: 9: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,234 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,235 INFO L280 TraceCheckUtils]: 0: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,235 INFO L280 TraceCheckUtils]: 1: Hoare triple {379#true} assume !(0 == ~x); {379#true} is VALID [2020-07-28 19:11:40,235 INFO L263 TraceCheckUtils]: 2: Hoare triple {379#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {379#true} is VALID [2020-07-28 19:11:40,236 INFO L280 TraceCheckUtils]: 3: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,236 INFO L280 TraceCheckUtils]: 4: Hoare triple {379#true} assume !(0 == ~x); {379#true} is VALID [2020-07-28 19:11:40,236 INFO L263 TraceCheckUtils]: 5: Hoare triple {379#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {379#true} is VALID [2020-07-28 19:11:40,237 INFO L280 TraceCheckUtils]: 6: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,237 INFO L280 TraceCheckUtils]: 7: Hoare triple {379#true} assume 0 == ~x;#res := 0; {379#true} is VALID [2020-07-28 19:11:40,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,238 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {379#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {379#true} is VALID [2020-07-28 19:11:40,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {379#true} assume !(~ret~0 > 3);#res := ~ret~0; {379#true} is VALID [2020-07-28 19:11:40,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,239 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,239 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {379#true} is VALID [2020-07-28 19:11:40,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {379#true} assume ~ret~0 > 3;#res := 3; {412#(<= |id_#res| 3)} is VALID [2020-07-28 19:11:40,242 INFO L280 TraceCheckUtils]: 16: Hoare triple {412#(<= |id_#res| 3)} assume true; {412#(<= |id_#res| 3)} is VALID [2020-07-28 19:11:40,244 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {412#(<= |id_#res| 3)} {379#true} #28#return; {399#(<= |ULTIMATE.start_main_#t~ret2| 3)} is VALID [2020-07-28 19:11:40,245 INFO L280 TraceCheckUtils]: 0: Hoare triple {379#true} havoc main_#res;havoc main_#t~nondet1, main_#t~ret2, main_~input~0, main_~result~0;assume -2147483648 <= main_#t~nondet1 && main_#t~nondet1 <= 2147483647;main_~input~0 := main_#t~nondet1;havoc main_#t~nondet1; {379#true} is VALID [2020-07-28 19:11:40,246 INFO L263 TraceCheckUtils]: 1: Hoare triple {379#true} call main_#t~ret2 := id(main_~input~0); {379#true} is VALID [2020-07-28 19:11:40,246 INFO L280 TraceCheckUtils]: 2: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,246 INFO L280 TraceCheckUtils]: 3: Hoare triple {379#true} assume !(0 == ~x); {379#true} is VALID [2020-07-28 19:11:40,247 INFO L263 TraceCheckUtils]: 4: Hoare triple {379#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {379#true} is VALID [2020-07-28 19:11:40,247 INFO L280 TraceCheckUtils]: 5: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,247 INFO L280 TraceCheckUtils]: 6: Hoare triple {379#true} assume !(0 == ~x); {379#true} is VALID [2020-07-28 19:11:40,248 INFO L263 TraceCheckUtils]: 7: Hoare triple {379#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {379#true} is VALID [2020-07-28 19:11:40,248 INFO L280 TraceCheckUtils]: 8: Hoare triple {379#true} ~x := #in~x; {379#true} is VALID [2020-07-28 19:11:40,248 INFO L280 TraceCheckUtils]: 9: Hoare triple {379#true} assume 0 == ~x;#res := 0; {379#true} is VALID [2020-07-28 19:11:40,248 INFO L280 TraceCheckUtils]: 10: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,249 INFO L275 TraceCheckUtils]: 11: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,249 INFO L280 TraceCheckUtils]: 12: Hoare triple {379#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {379#true} is VALID [2020-07-28 19:11:40,249 INFO L280 TraceCheckUtils]: 13: Hoare triple {379#true} assume !(~ret~0 > 3);#res := ~ret~0; {379#true} is VALID [2020-07-28 19:11:40,250 INFO L280 TraceCheckUtils]: 14: Hoare triple {379#true} assume true; {379#true} is VALID [2020-07-28 19:11:40,250 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {379#true} {379#true} #30#return; {379#true} is VALID [2020-07-28 19:11:40,250 INFO L280 TraceCheckUtils]: 16: Hoare triple {379#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {379#true} is VALID [2020-07-28 19:11:40,251 INFO L280 TraceCheckUtils]: 17: Hoare triple {379#true} assume ~ret~0 > 3;#res := 3; {412#(<= |id_#res| 3)} is VALID [2020-07-28 19:11:40,252 INFO L280 TraceCheckUtils]: 18: Hoare triple {412#(<= |id_#res| 3)} assume true; {412#(<= |id_#res| 3)} is VALID [2020-07-28 19:11:40,254 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {412#(<= |id_#res| 3)} {379#true} #28#return; {399#(<= |ULTIMATE.start_main_#t~ret2| 3)} is VALID [2020-07-28 19:11:40,255 INFO L280 TraceCheckUtils]: 20: Hoare triple {399#(<= |ULTIMATE.start_main_#t~ret2| 3)} assume -2147483648 <= main_#t~ret2 && main_#t~ret2 <= 2147483647;main_~result~0 := main_#t~ret2;havoc main_#t~ret2; {400#(<= ULTIMATE.start_main_~result~0 3)} is VALID [2020-07-28 19:11:40,255 INFO L280 TraceCheckUtils]: 21: Hoare triple {400#(<= ULTIMATE.start_main_~result~0 3)} assume 5 == main_~result~0; {380#false} is VALID [2020-07-28 19:11:40,256 INFO L280 TraceCheckUtils]: 22: Hoare triple {380#false} assume !false; {380#false} is VALID [2020-07-28 19:11:40,257 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2020-07-28 19:11:40,257 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656257814] [2020-07-28 19:11:40,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 19:11:40,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 19:11:40,258 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679940148] [2020-07-28 19:11:40,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-28 19:11:40,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 19:11:40,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 19:11:40,280 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 19:11:40,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 19:11:40,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 19:11:40,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 19:11:40,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:40,282 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 5 states. [2020-07-28 19:11:40,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:40,335 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-28 19:11:40,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 19:11:40,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2020-07-28 19:11:40,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 19:11:40,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:40,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-28 19:11:40,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 19:11:40,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 15 transitions. [2020-07-28 19:11:40,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 15 transitions. [2020-07-28 19:11:40,360 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 19:11:40,361 INFO L225 Difference]: With dead ends: 19 [2020-07-28 19:11:40,361 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 19:11:40,362 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 19:11:40,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 19:11:40,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 19:11:40,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 19:11:40,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:40,363 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:40,363 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:40,364 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:11:40,364 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:40,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:40,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:40,365 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:40,365 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 19:11:40,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 19:11:40,366 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 19:11:40,366 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:40,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:40,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 19:11:40,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 19:11:40,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 19:11:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 19:11:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 19:11:40,368 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-28 19:11:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 19:11:40,368 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 19:11:40,368 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 19:11:40,369 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 19:11:40,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 19:11:40,369 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 19:11:40,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 19:11:40,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 19:11:40,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 19:11:40,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 19:11:40,392 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point L11(lines 11 17) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-28 19:11:40,393 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-28 19:11:40,394 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-28 19:11:40,394 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-28 19:11:40,394 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-28 19:11:40,394 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-28 19:11:40,394 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-28 19:11:40,400 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:11:40,401 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L11 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-28 19:11:40,402 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 19:11:40,403 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 19:11:40,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 07:11:40 BoogieIcfgContainer [2020-07-28 19:11:40,405 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 19:11:40,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 19:11:40,406 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 19:11:40,406 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 19:11:40,407 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 07:11:37" (3/4) ... [2020-07-28 19:11:40,410 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 19:11:40,419 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure id [2020-07-28 19:11:40,424 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 19:11:40,424 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 19:11:40,470 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 19:11:40,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 19:11:40,474 INFO L168 Benchmark]: Toolchain (without parser) took 3442.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 960.2 MB in the beginning and 870.9 MB in the end (delta: 89.3 MB). Peak memory consumption was 227.2 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:40,474 INFO L168 Benchmark]: CDTParser took 0.88 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 19:11:40,475 INFO L168 Benchmark]: CACSL2BoogieTranslator took 251.60 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:40,475 INFO L168 Benchmark]: Boogie Procedure Inliner took 32.59 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:11:40,476 INFO L168 Benchmark]: Boogie Preprocessor took 79.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:40,476 INFO L168 Benchmark]: RCFGBuilder took 362.17 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:40,477 INFO L168 Benchmark]: TraceAbstraction took 2638.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.9 MB in the end (delta: 237.7 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. [2020-07-28 19:11:40,477 INFO L168 Benchmark]: Witness Printer took 65.00 ms. Allocated memory is still 1.2 GB. Free memory is still 870.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 19:11:40,480 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.88 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 251.60 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 948.1 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 32.59 ms. Allocated memory is still 1.0 GB. Free memory is still 948.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 79.40 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 948.1 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 362.17 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: 25.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2638.97 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 870.9 MB in the end (delta: 237.7 MB). Peak memory consumption was 237.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.00 ms. Allocated memory is still 1.2 GB. Free memory is still 870.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.5s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 57 SDtfs, 7 SDslu, 184 SDs, 0 SdLazy, 58 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=3, 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, 4 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 5 PreInvPairs, 5 NumberOfFragments, 3 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 80 NumberOfCodeBlocks, 80 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 2303 SizeOfPredicates, 2 NumberOfNonLiveVariables, 43 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 23/27 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...