java -ea -Xmx8000000000 -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 ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 16:44:15,926 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 16:44:15,928 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 16:44:15,945 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 16:44:15,945 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 16:44:15,946 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 16:44:15,950 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 16:44:15,952 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 16:44:15,954 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 16:44:15,954 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 16:44:15,955 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 16:44:15,956 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 16:44:15,957 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 16:44:15,958 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 16:44:15,959 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 16:44:15,960 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 16:44:15,961 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 16:44:15,962 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 16:44:15,964 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 16:44:15,966 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 16:44:15,968 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 16:44:15,969 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 16:44:15,974 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 16:44:15,974 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 16:44:15,974 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 16:44:15,975 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 16:44:15,978 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 16:44:15,979 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 16:44:15,980 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 16:44:15,981 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 16:44:15,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 16:44:15,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 16:44:15,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 16:44:15,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 16:44:15,987 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 16:44:15,988 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 16:44:15,989 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-14 16:44:16,015 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 16:44:16,016 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 16:44:16,017 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 16:44:16,017 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 16:44:16,017 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 16:44:16,018 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 16:44:16,018 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 16:44:16,018 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 16:44:16,018 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 16:44:16,019 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 16:44:16,019 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 16:44:16,019 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 16:44:16,019 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 16:44:16,019 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 16:44:16,020 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-14 16:44:16,020 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-14 16:44:16,020 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 16:44:16,020 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 16:44:16,020 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 16:44:16,021 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 16:44:16,021 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 16:44:16,021 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 16:44:16,021 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 16:44:16,021 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 16:44:16,022 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 16:44:16,022 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 16:44:16,022 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 16:44:16,022 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-14 16:44:16,022 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 16:44:16,023 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-14 16:44:16,023 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-14 16:44:16,023 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 16:44:16,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 16:44:16,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 16:44:16,101 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 16:44:16,102 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 16:44:16,103 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 16:44:16,103 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-14 16:44:16,171 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cb0ba1b/0d12486925244cc6b20ff9c5425d192f/FLAG881dc4af5 [2018-11-14 16:44:16,671 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 16:44:16,671 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005_true-unreach-call_true-termination.c.i [2018-11-14 16:44:16,677 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cb0ba1b/0d12486925244cc6b20ff9c5425d192f/FLAG881dc4af5 [2018-11-14 16:44:16,692 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/94cb0ba1b/0d12486925244cc6b20ff9c5425d192f [2018-11-14 16:44:16,703 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 16:44:16,704 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 16:44:16,705 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 16:44:16,705 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 16:44:16,709 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 16:44:16,711 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:16,714 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b46579 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16, skipping insertion in model container [2018-11-14 16:44:16,714 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:16,725 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 16:44:16,746 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 16:44:16,933 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:44:16,940 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 16:44:16,959 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 16:44:16,977 INFO L195 MainTranslator]: Completed translation [2018-11-14 16:44:16,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16 WrapperNode [2018-11-14 16:44:16,978 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 16:44:16,979 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 16:44:16,979 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 16:44:16,979 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 16:44:16,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:16,996 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,011 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,016 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (1/1) ... [2018-11-14 16:44:17,019 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 16:44:17,020 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 16:44:17,020 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 16:44:17,020 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 16:44:17,021 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (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 [2018-11-14 16:44:17,186 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 16:44:17,187 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 16:44:17,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-14 16:44:17,187 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 16:44:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 16:44:17,187 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2018-11-14 16:44:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-14 16:44:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 16:44:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 16:44:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 16:44:17,188 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 16:44:17,733 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 16:44:17,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:44:17 BoogieIcfgContainer [2018-11-14 16:44:17,734 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 16:44:17,735 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 16:44:17,735 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 16:44:17,740 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 16:44:17,740 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 04:44:16" (1/3) ... [2018-11-14 16:44:17,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e05e23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:44:17, skipping insertion in model container [2018-11-14 16:44:17,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 04:44:16" (2/3) ... [2018-11-14 16:44:17,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e05e23f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 04:44:17, skipping insertion in model container [2018-11-14 16:44:17,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 04:44:17" (3/3) ... [2018-11-14 16:44:17,753 INFO L112 eAbstractionObserver]: Analyzing ICFG cggmp2005_true-unreach-call_true-termination.c.i [2018-11-14 16:44:17,765 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 16:44:17,773 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 16:44:17,794 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 16:44:17,826 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 16:44:17,827 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 16:44:17,827 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 16:44:17,827 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 16:44:17,827 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 16:44:17,827 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 16:44:17,828 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 16:44:17,828 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 16:44:17,828 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 16:44:17,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-14 16:44:17,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-14 16:44:17,860 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:17,861 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:17,863 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:17,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:17,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1871509567, now seen corresponding path program 1 times [2018-11-14 16:44:17,874 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:17,875 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:17,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:17,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:17,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:17,949 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:18,025 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-14 16:44:18,029 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-14 16:44:18,029 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #33#return; {22#true} is VALID [2018-11-14 16:44:18,030 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-14 16:44:18,030 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {22#true} is VALID [2018-11-14 16:44:18,042 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-14 16:44:18,043 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {23#false} is VALID [2018-11-14 16:44:18,043 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-14 16:44:18,043 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume ~cond == 0bv32; {23#false} is VALID [2018-11-14 16:44:18,044 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-14 16:44:18,046 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:18,046 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:18,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:18,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 16:44:18,057 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:44:18,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:18,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 16:44:18,130 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:18,131 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 16:44:18,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 16:44:18,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:44:18,142 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-14 16:44:18,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,226 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2018-11-14 16:44:18,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 16:44:18,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-14 16:44:18,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:18,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:44:18,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:44:18,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 16:44:18,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-14 16:44:18,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-14 16:44:18,465 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:18,476 INFO L225 Difference]: With dead ends: 31 [2018-11-14 16:44:18,477 INFO L226 Difference]: Without dead ends: 12 [2018-11-14 16:44:18,480 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 16:44:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2018-11-14 16:44:18,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2018-11-14 16:44:18,558 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:18,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand 12 states. [2018-11-14 16:44:18,559 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:44:18,559 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:44:18,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,563 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:44:18,563 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:44:18,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:18,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:18,564 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand 12 states. [2018-11-14 16:44:18,564 INFO L87 Difference]: Start difference. First operand 12 states. Second operand 12 states. [2018-11-14 16:44:18,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:18,567 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2018-11-14 16:44:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:44:18,568 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:18,568 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:18,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:18,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2018-11-14 16:44:18,572 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2018-11-14 16:44:18,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:18,572 INFO L480 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2018-11-14 16:44:18,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 16:44:18,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2018-11-14 16:44:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-11-14 16:44:18,573 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:18,573 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:18,574 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:18,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:18,574 INFO L82 PathProgramCache]: Analyzing trace with hash 1861991801, now seen corresponding path program 1 times [2018-11-14 16:44:18,575 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:18,575 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:18,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:18,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:18,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:18,617 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:18,837 INFO L256 TraceCheckUtils]: 0: Hoare triple {136#true} call ULTIMATE.init(); {136#true} is VALID [2018-11-14 16:44:18,838 INFO L273 TraceCheckUtils]: 1: Hoare triple {136#true} assume true; {136#true} is VALID [2018-11-14 16:44:18,838 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {136#true} {136#true} #33#return; {136#true} is VALID [2018-11-14 16:44:18,839 INFO L256 TraceCheckUtils]: 3: Hoare triple {136#true} call #t~ret1 := main(); {136#true} is VALID [2018-11-14 16:44:18,851 INFO L273 TraceCheckUtils]: 4: Hoare triple {136#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {153#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:18,865 INFO L273 TraceCheckUtils]: 5: Hoare triple {153#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {153#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:18,870 INFO L273 TraceCheckUtils]: 6: Hoare triple {153#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~i~0); {137#false} is VALID [2018-11-14 16:44:18,870 INFO L256 TraceCheckUtils]: 7: Hoare triple {137#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {137#false} is VALID [2018-11-14 16:44:18,871 INFO L273 TraceCheckUtils]: 8: Hoare triple {137#false} ~cond := #in~cond; {137#false} is VALID [2018-11-14 16:44:18,871 INFO L273 TraceCheckUtils]: 9: Hoare triple {137#false} assume ~cond == 0bv32; {137#false} is VALID [2018-11-14 16:44:18,871 INFO L273 TraceCheckUtils]: 10: Hoare triple {137#false} assume !false; {137#false} is VALID [2018-11-14 16:44:18,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:18,873 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-14 16:44:18,877 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 16:44:18,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-14 16:44:18,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:44:18,880 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:18,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-14 16:44:18,921 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:18,922 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-14 16:44:18,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-14 16:44:18,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:44:18,923 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 3 states. [2018-11-14 16:44:19,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,045 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-11-14 16:44:19,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-14 16:44:19,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-11-14 16:44:19,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:19,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:44:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 16:44:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-14 16:44:19,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 19 transitions. [2018-11-14 16:44:19,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 19 transitions. [2018-11-14 16:44:19,137 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:19,139 INFO L225 Difference]: With dead ends: 19 [2018-11-14 16:44:19,139 INFO L226 Difference]: Without dead ends: 14 [2018-11-14 16:44:19,140 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-14 16:44:19,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-14 16:44:19,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-14 16:44:19,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:19,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-14 16:44:19,178 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:44:19,178 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:44:19,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,180 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:44:19,180 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:44:19,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:19,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:19,181 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-14 16:44:19,181 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-14 16:44:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:19,183 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-11-14 16:44:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:44:19,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:19,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:19,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:19,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:19,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-14 16:44:19,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2018-11-14 16:44:19,186 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2018-11-14 16:44:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:19,187 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2018-11-14 16:44:19,187 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-14 16:44:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2018-11-14 16:44:19,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-14 16:44:19,188 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:19,188 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:19,188 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:19,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -661808769, now seen corresponding path program 1 times [2018-11-14 16:44:19,189 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:19,219 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 16:44:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:19,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:19,247 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:19,406 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-14 16:44:19,406 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-14 16:44:19,406 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #33#return; {250#true} is VALID [2018-11-14 16:44:19,407 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-14 16:44:19,407 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {267#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:19,408 INFO L273 TraceCheckUtils]: 5: Hoare triple {267#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {267#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:19,409 INFO L273 TraceCheckUtils]: 6: Hoare triple {267#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {274#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:19,410 INFO L273 TraceCheckUtils]: 7: Hoare triple {274#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume true; {274#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:19,411 INFO L273 TraceCheckUtils]: 8: Hoare triple {274#(and (= (bvadd main_~j~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !~bvsge32(~j~0, ~i~0); {251#false} is VALID [2018-11-14 16:44:19,412 INFO L256 TraceCheckUtils]: 9: Hoare triple {251#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {251#false} is VALID [2018-11-14 16:44:19,412 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-14 16:44:19,413 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} assume ~cond == 0bv32; {251#false} is VALID [2018-11-14 16:44:19,413 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-14 16:44:19,415 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:19,415 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:19,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {251#false} assume !false; {251#false} is VALID [2018-11-14 16:44:19,717 INFO L273 TraceCheckUtils]: 11: Hoare triple {251#false} assume ~cond == 0bv32; {251#false} is VALID [2018-11-14 16:44:19,717 INFO L273 TraceCheckUtils]: 10: Hoare triple {251#false} ~cond := #in~cond; {251#false} is VALID [2018-11-14 16:44:19,718 INFO L256 TraceCheckUtils]: 9: Hoare triple {251#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {251#false} is VALID [2018-11-14 16:44:19,730 INFO L273 TraceCheckUtils]: 8: Hoare triple {305#(bvsge main_~j~0 main_~i~0)} assume !~bvsge32(~j~0, ~i~0); {251#false} is VALID [2018-11-14 16:44:19,749 INFO L273 TraceCheckUtils]: 7: Hoare triple {305#(bvsge main_~j~0 main_~i~0)} assume true; {305#(bvsge main_~j~0 main_~i~0)} is VALID [2018-11-14 16:44:19,759 INFO L273 TraceCheckUtils]: 6: Hoare triple {312#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {305#(bvsge main_~j~0 main_~i~0)} is VALID [2018-11-14 16:44:19,774 INFO L273 TraceCheckUtils]: 5: Hoare triple {312#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} assume true; {312#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:19,783 INFO L273 TraceCheckUtils]: 4: Hoare triple {250#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {312#(bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))} is VALID [2018-11-14 16:44:19,784 INFO L256 TraceCheckUtils]: 3: Hoare triple {250#true} call #t~ret1 := main(); {250#true} is VALID [2018-11-14 16:44:19,784 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {250#true} {250#true} #33#return; {250#true} is VALID [2018-11-14 16:44:19,785 INFO L273 TraceCheckUtils]: 1: Hoare triple {250#true} assume true; {250#true} is VALID [2018-11-14 16:44:19,785 INFO L256 TraceCheckUtils]: 0: Hoare triple {250#true} call ULTIMATE.init(); {250#true} is VALID [2018-11-14 16:44:19,790 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:19,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:19,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2018-11-14 16:44:19,799 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:44:19,799 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:19,799 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 16:44:19,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:19,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 16:44:19,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 16:44:19,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-11-14 16:44:19,975 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 6 states. [2018-11-14 16:44:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,309 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-14 16:44:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 16:44:20,309 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-14 16:44:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:20,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:20,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-14 16:44:20,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 16:44:20,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-14 16:44:20,314 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 27 transitions. [2018-11-14 16:44:20,434 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:20,435 INFO L225 Difference]: With dead ends: 25 [2018-11-14 16:44:20,435 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 16:44:20,436 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2018-11-14 16:44:20,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 16:44:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 16:44:20,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:20,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 16:44:20,452 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:44:20,452 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:44:20,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,454 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:44:20,454 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:44:20,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,455 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 16:44:20,455 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 16:44:20,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:20,458 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-11-14 16:44:20,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:44:20,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:20,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:20,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:20,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:20,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 16:44:20,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-11-14 16:44:20,461 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-11-14 16:44:20,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:20,461 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-11-14 16:44:20,461 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 16:44:20,461 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-11-14 16:44:20,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-14 16:44:20,462 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:20,462 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:20,463 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:20,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:20,463 INFO L82 PathProgramCache]: Analyzing trace with hash -875350895, now seen corresponding path program 2 times [2018-11-14 16:44:20,464 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:20,464 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:20,482 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-14 16:44:20,512 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-14 16:44:20,512 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:44:20,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:20,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:20,822 INFO L256 TraceCheckUtils]: 0: Hoare triple {444#true} call ULTIMATE.init(); {444#true} is VALID [2018-11-14 16:44:20,823 INFO L273 TraceCheckUtils]: 1: Hoare triple {444#true} assume true; {444#true} is VALID [2018-11-14 16:44:20,823 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} #33#return; {444#true} is VALID [2018-11-14 16:44:20,824 INFO L256 TraceCheckUtils]: 3: Hoare triple {444#true} call #t~ret1 := main(); {444#true} is VALID [2018-11-14 16:44:20,828 INFO L273 TraceCheckUtils]: 4: Hoare triple {444#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,829 INFO L273 TraceCheckUtils]: 5: Hoare triple {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,830 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {468#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-14 16:44:20,830 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(= (_ bv9 32) main_~j~0)} assume true; {468#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-14 16:44:20,833 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(= (_ bv9 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,834 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,837 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {482#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-14 16:44:20,838 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#(= (_ bv7 32) main_~j~0)} assume true; {482#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-14 16:44:20,839 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#(= (_ bv7 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,839 INFO L273 TraceCheckUtils]: 13: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,840 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume !~bvsge32(~j~0, ~i~0); {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,844 INFO L256 TraceCheckUtils]: 15: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {499#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,845 INFO L273 TraceCheckUtils]: 16: Hoare triple {499#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {503#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:20,846 INFO L273 TraceCheckUtils]: 17: Hoare triple {503#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume ~cond == 0bv32; {445#false} is VALID [2018-11-14 16:44:20,846 INFO L273 TraceCheckUtils]: 18: Hoare triple {445#false} assume !false; {445#false} is VALID [2018-11-14 16:44:20,848 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:20,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:21,074 INFO L273 TraceCheckUtils]: 18: Hoare triple {445#false} assume !false; {445#false} is VALID [2018-11-14 16:44:21,075 INFO L273 TraceCheckUtils]: 17: Hoare triple {513#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume ~cond == 0bv32; {445#false} is VALID [2018-11-14 16:44:21,076 INFO L273 TraceCheckUtils]: 16: Hoare triple {517#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {513#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-14 16:44:21,077 INFO L256 TraceCheckUtils]: 15: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {517#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-14 16:44:21,077 INFO L273 TraceCheckUtils]: 14: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume !~bvsge32(~j~0, ~i~0); {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,078 INFO L273 TraceCheckUtils]: 13: Hoare triple {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} assume true; {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,079 INFO L273 TraceCheckUtils]: 12: Hoare triple {482#(= (_ bv7 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {489#(= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,080 INFO L273 TraceCheckUtils]: 11: Hoare triple {482#(= (_ bv7 32) main_~j~0)} assume true; {482#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-14 16:44:21,081 INFO L273 TraceCheckUtils]: 10: Hoare triple {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {482#(= (_ bv7 32) main_~j~0)} is VALID [2018-11-14 16:44:21,082 INFO L273 TraceCheckUtils]: 9: Hoare triple {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} assume true; {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,083 INFO L273 TraceCheckUtils]: 8: Hoare triple {468#(= (_ bv9 32) main_~j~0)} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {475#(= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,084 INFO L273 TraceCheckUtils]: 7: Hoare triple {468#(= (_ bv9 32) main_~j~0)} assume true; {468#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-14 16:44:21,085 INFO L273 TraceCheckUtils]: 6: Hoare triple {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {468#(= (_ bv9 32) main_~j~0)} is VALID [2018-11-14 16:44:21,086 INFO L273 TraceCheckUtils]: 5: Hoare triple {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} assume true; {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,087 INFO L273 TraceCheckUtils]: 4: Hoare triple {444#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {461#(= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32))} is VALID [2018-11-14 16:44:21,087 INFO L256 TraceCheckUtils]: 3: Hoare triple {444#true} call #t~ret1 := main(); {444#true} is VALID [2018-11-14 16:44:21,087 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {444#true} {444#true} #33#return; {444#true} is VALID [2018-11-14 16:44:21,088 INFO L273 TraceCheckUtils]: 1: Hoare triple {444#true} assume true; {444#true} is VALID [2018-11-14 16:44:21,088 INFO L256 TraceCheckUtils]: 0: Hoare triple {444#true} call ULTIMATE.init(); {444#true} is VALID [2018-11-14 16:44:21,090 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:21,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:21,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-11-14 16:44:21,093 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-14 16:44:21,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:21,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2018-11-14 16:44:21,132 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:21,132 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-14 16:44:21,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-14 16:44:21,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-11-14 16:44:21,133 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 11 states. [2018-11-14 16:44:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:21,567 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-11-14 16:44:21,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-14 16:44:21,567 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 19 [2018-11-14 16:44:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:21,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:44:21,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-14 16:44:21,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-14 16:44:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 27 transitions. [2018-11-14 16:44:21,572 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 27 transitions. [2018-11-14 16:44:21,622 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:21,623 INFO L225 Difference]: With dead ends: 27 [2018-11-14 16:44:21,623 INFO L226 Difference]: Without dead ends: 22 [2018-11-14 16:44:21,624 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:21,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-14 16:44:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2018-11-14 16:44:21,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:21,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2018-11-14 16:44:21,652 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:44:21,653 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:44:21,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:21,655 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 16:44:21,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 16:44:21,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:21,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:21,656 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2018-11-14 16:44:21,656 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2018-11-14 16:44:21,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:21,658 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 16:44:21,658 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 16:44:21,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:21,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:21,659 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:21,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:21,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-14 16:44:21,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2018-11-14 16:44:21,661 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 19 [2018-11-14 16:44:21,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:21,662 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2018-11-14 16:44:21,662 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-14 16:44:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2018-11-14 16:44:21,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 16:44:21,663 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 16:44:21,663 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 16:44:21,663 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 16:44:21,664 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 16:44:21,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1566812823, now seen corresponding path program 3 times [2018-11-14 16:44:21,664 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-14 16:44:21,665 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-14 16:44:21,687 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-14 16:44:21,769 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-14 16:44:21,769 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-14 16:44:21,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 16:44:21,778 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 16:44:22,136 INFO L256 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2018-11-14 16:44:22,136 INFO L273 TraceCheckUtils]: 1: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 16:44:22,137 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} #33#return; {689#true} is VALID [2018-11-14 16:44:22,137 INFO L256 TraceCheckUtils]: 3: Hoare triple {689#true} call #t~ret1 := main(); {689#true} is VALID [2018-11-14 16:44:22,139 INFO L273 TraceCheckUtils]: 4: Hoare triple {689#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {706#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,148 INFO L273 TraceCheckUtils]: 5: Hoare triple {706#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume true; {706#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,149 INFO L273 TraceCheckUtils]: 6: Hoare triple {706#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {713#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} is VALID [2018-11-14 16:44:22,150 INFO L273 TraceCheckUtils]: 7: Hoare triple {713#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} assume true; {713#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} is VALID [2018-11-14 16:44:22,151 INFO L273 TraceCheckUtils]: 8: Hoare triple {713#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {720#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,151 INFO L273 TraceCheckUtils]: 9: Hoare triple {720#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume true; {720#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,153 INFO L273 TraceCheckUtils]: 10: Hoare triple {720#(and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {727#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,154 INFO L273 TraceCheckUtils]: 11: Hoare triple {727#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume true; {727#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,156 INFO L273 TraceCheckUtils]: 12: Hoare triple {727#(and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {734#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,160 INFO L273 TraceCheckUtils]: 13: Hoare triple {734#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} assume true; {734#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} is VALID [2018-11-14 16:44:22,180 INFO L273 TraceCheckUtils]: 14: Hoare triple {734#(and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {690#false} is VALID [2018-11-14 16:44:22,180 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#false} assume true; {690#false} is VALID [2018-11-14 16:44:22,180 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#false} assume !~bvsge32(~j~0, ~i~0); {690#false} is VALID [2018-11-14 16:44:22,181 INFO L256 TraceCheckUtils]: 17: Hoare triple {690#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {690#false} is VALID [2018-11-14 16:44:22,181 INFO L273 TraceCheckUtils]: 18: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2018-11-14 16:44:22,181 INFO L273 TraceCheckUtils]: 19: Hoare triple {690#false} assume ~cond == 0bv32; {690#false} is VALID [2018-11-14 16:44:22,181 INFO L273 TraceCheckUtils]: 20: Hoare triple {690#false} assume !false; {690#false} is VALID [2018-11-14 16:44:22,183 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:22,184 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-14 16:44:25,867 INFO L273 TraceCheckUtils]: 20: Hoare triple {690#false} assume !false; {690#false} is VALID [2018-11-14 16:44:25,868 INFO L273 TraceCheckUtils]: 19: Hoare triple {690#false} assume ~cond == 0bv32; {690#false} is VALID [2018-11-14 16:44:25,868 INFO L273 TraceCheckUtils]: 18: Hoare triple {690#false} ~cond := #in~cond; {690#false} is VALID [2018-11-14 16:44:25,868 INFO L256 TraceCheckUtils]: 17: Hoare triple {690#false} call __VERIFIER_assert((if ~j~0 == 6bv32 then 1bv32 else 0bv32)); {690#false} is VALID [2018-11-14 16:44:25,869 INFO L273 TraceCheckUtils]: 16: Hoare triple {690#false} assume !~bvsge32(~j~0, ~i~0); {690#false} is VALID [2018-11-14 16:44:25,869 INFO L273 TraceCheckUtils]: 15: Hoare triple {690#false} assume true; {690#false} is VALID [2018-11-14 16:44:25,870 INFO L273 TraceCheckUtils]: 14: Hoare triple {777#(not (bvsge main_~j~0 main_~i~0))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {690#false} is VALID [2018-11-14 16:44:25,870 INFO L273 TraceCheckUtils]: 13: Hoare triple {777#(not (bvsge main_~j~0 main_~i~0))} assume true; {777#(not (bvsge main_~j~0 main_~i~0))} is VALID [2018-11-14 16:44:25,871 INFO L273 TraceCheckUtils]: 12: Hoare triple {784#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {777#(not (bvsge main_~j~0 main_~i~0))} is VALID [2018-11-14 16:44:25,871 INFO L273 TraceCheckUtils]: 11: Hoare triple {784#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} assume true; {784#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} is VALID [2018-11-14 16:44:26,037 INFO L273 TraceCheckUtils]: 10: Hoare triple {791#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {784#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge main_~j~0 main_~i~0)))} is VALID [2018-11-14 16:44:26,038 INFO L273 TraceCheckUtils]: 9: Hoare triple {791#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume true; {791#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-14 16:44:26,549 INFO L273 TraceCheckUtils]: 8: Hoare triple {798#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {791#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967295 32)) (bvadd main_~i~0 (_ bv2 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-14 16:44:26,550 INFO L273 TraceCheckUtils]: 7: Hoare triple {798#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} assume true; {798#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-14 16:44:27,049 INFO L273 TraceCheckUtils]: 6: Hoare triple {805#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} assume !!~bvsge32(~j~0, ~i~0);~i~0 := ~bvadd32(2bv32, ~i~0);~j~0 := ~bvadd32(4294967295bv32, ~j~0); {798#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967294 32)) (bvadd main_~i~0 (_ bv4 32)))))} is VALID [2018-11-14 16:44:27,064 INFO L273 TraceCheckUtils]: 5: Hoare triple {805#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} assume true; {805#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} is VALID [2018-11-14 16:44:27,065 INFO L273 TraceCheckUtils]: 4: Hoare triple {689#true} havoc ~i~0;havoc ~j~0;~i~0 := 1bv32;~j~0 := 10bv32; {805#(or (not (bvsge (bvadd main_~j~0 (_ bv4294967292 32)) (bvadd main_~i~0 (_ bv8 32)))) (not (bvsge (bvadd main_~j~0 (_ bv4294967293 32)) (bvadd main_~i~0 (_ bv6 32)))))} is VALID [2018-11-14 16:44:27,066 INFO L256 TraceCheckUtils]: 3: Hoare triple {689#true} call #t~ret1 := main(); {689#true} is VALID [2018-11-14 16:44:27,066 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {689#true} {689#true} #33#return; {689#true} is VALID [2018-11-14 16:44:27,066 INFO L273 TraceCheckUtils]: 1: Hoare triple {689#true} assume true; {689#true} is VALID [2018-11-14 16:44:27,066 INFO L256 TraceCheckUtils]: 0: Hoare triple {689#true} call ULTIMATE.init(); {689#true} is VALID [2018-11-14 16:44:27,069 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 16:44:27,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 16:44:27,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-14 16:44:27,074 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 16:44:27,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 16:44:27,075 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-14 16:44:28,252 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:28,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-14 16:44:28,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-14 16:44:28,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:28,253 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 12 states. [2018-11-14 16:44:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,546 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-11-14 16:44:28,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-14 16:44:28,546 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 21 [2018-11-14 16:44:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 16:44:28,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:28,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-14 16:44:28,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-14 16:44:28,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-14 16:44:28,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 22 transitions. [2018-11-14 16:44:28,584 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 16:44:28,584 INFO L225 Difference]: With dead ends: 22 [2018-11-14 16:44:28,584 INFO L226 Difference]: Without dead ends: 0 [2018-11-14 16:44:28,585 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2018-11-14 16:44:28,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-14 16:44:28,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-14 16:44:28,586 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 16:44:28,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2018-11-14 16:44:28,587 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:44:28,587 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:44:28,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,588 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:44:28,588 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:44:28,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,588 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2018-11-14 16:44:28,589 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2018-11-14 16:44:28,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 16:44:28,589 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2018-11-14 16:44:28,589 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:44:28,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 16:44:28,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 16:44:28,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 16:44:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-14 16:44:28,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-14 16:44:28,590 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-14 16:44:28,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 16:44:28,590 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-14 16:44:28,590 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-14 16:44:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-14 16:44:28,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 16:44:28,595 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-14 16:44:28,883 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 37 [2018-11-14 16:44:28,912 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-11-14 16:44:28,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:44:28,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-14 16:44:28,912 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-14 16:44:28,912 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-14 16:44:28,912 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-14 16:44:28,913 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 10 20) the Hoare annotation is: true [2018-11-14 16:44:28,913 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 10 20) no Hoare annotation was computed. [2018-11-14 16:44:28,913 INFO L425 ceAbstractionStarter]: For program point L18(line 18) no Hoare annotation was computed. [2018-11-14 16:44:28,913 INFO L425 ceAbstractionStarter]: For program point L14-1(lines 14 17) no Hoare annotation was computed. [2018-11-14 16:44:28,913 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 10 20) no Hoare annotation was computed. [2018-11-14 16:44:28,914 INFO L421 ceAbstractionStarter]: At program point L14-3(lines 14 17) the Hoare annotation is: (or (and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv9 32) main_~j~0)) (and (= (_ bv7 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967289 32)) (_ bv0 32))) (and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32))) (and (= (bvadd main_~j~0 (_ bv4294967288 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967291 32)) (_ bv0 32))) (and (= (bvadd main_~i~0 (_ bv4294967287 32)) (_ bv0 32)) (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)))) [2018-11-14 16:44:28,914 INFO L421 ceAbstractionStarter]: At program point L14-4(lines 14 17) the Hoare annotation is: (= (bvadd main_~j~0 (_ bv4294967290 32)) (_ bv0 32)) [2018-11-14 16:44:28,914 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2018-11-14 16:44:28,914 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2018-11-14 16:44:28,914 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:44:28,914 INFO L425 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2018-11-14 16:44:28,915 INFO L425 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2018-11-14 16:44:28,915 INFO L425 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2018-11-14 16:44:28,917 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:44:28,919 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:44:28,919 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-14 16:44:28,919 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:44:28,919 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:44:28,919 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-14 16:44:28,920 WARN L170 areAnnotationChecker]: L18 has no Hoare annotation [2018-11-14 16:44:28,921 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-14 16:44:28,921 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-14 16:44:28,921 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-14 16:44:28,921 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-14 16:44:28,937 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.11 04:44:28 BoogieIcfgContainer [2018-11-14 16:44:28,937 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-14 16:44:28,939 INFO L168 Benchmark]: Toolchain (without parser) took 12235.42 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -463.6 MB). Peak memory consumption was 300.8 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:28,941 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:44:28,942 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:28,943 INFO L168 Benchmark]: Boogie Preprocessor took 40.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 16:44:28,943 INFO L168 Benchmark]: RCFGBuilder took 714.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:28,944 INFO L168 Benchmark]: TraceAbstraction took 11201.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 338.5 MB). Peak memory consumption was 338.5 MB. Max. memory is 7.1 GB. [2018-11-14 16:44:28,950 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 273.48 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.60 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 714.57 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 764.4 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -812.6 MB). Peak memory consumption was 26.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11201.86 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.9 GB in the end (delta: 338.5 MB). Peak memory consumption was 338.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: ((((~bvadd64(i, 4294967293bv32) == 0bv32 && 9bv32 == j) || (7bv32 == j && ~bvadd64(i, 4294967289bv32) == 0bv32)) || (~bvadd64(j, 4294967286bv32) == 0bv32 && ~bvadd64(i, 4294967295bv32) == 0bv32)) || (~bvadd64(j, 4294967288bv32) == 0bv32 && ~bvadd64(i, 4294967291bv32) == 0bv32)) || (~bvadd64(i, 4294967287bv32) == 0bv32 && ~bvadd64(j, 4294967290bv32) == 0bv32) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. SAFE Result, 11.1s OverallTime, 5 OverallIterations, 6 TraceHistogramMax, 1.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 65 SDtfs, 1 SDslu, 164 SDs, 0 SdLazy, 103 SolverSat, 7 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 11 PreInvPairs, 17 NumberOfFragments, 62 HoareAnnotationTreeSize, 11 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 18 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 6.8s InterpolantComputationTime, 74 NumberOfCodeBlocks, 74 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 119 ConstructedInterpolants, 0 QuantifiedInterpolants, 8697 SizeOfPredicates, 6 NumberOfNonLiveVariables, 139 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 22/104 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...