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/AutomizerCInline_WitnessPrinter.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:47,794 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:47,796 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:47,809 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:47,809 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:47,810 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:47,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:47,813 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:47,815 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:47,816 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:47,817 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:47,817 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:47,818 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:47,819 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:47,821 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:47,821 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:47,822 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:47,824 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:47,826 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:47,828 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:47,829 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:47,830 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:47,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:47,840 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:47,841 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:47,842 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:47,843 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:47,843 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:47,847 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:47,848 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:47,848 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:47,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:47,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:47,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:47,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:47,855 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:47,855 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:02:47,886 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:47,887 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:47,888 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:47,888 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:47,892 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:47,892 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:47,892 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:47,892 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:47,893 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:47,893 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:47,893 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:47,893 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:47,893 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:47,894 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:47,894 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:47,894 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:47,894 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:47,894 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:47,895 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:47,896 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:47,896 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:47,896 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:47,896 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:47,897 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:47,897 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:47,897 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:47,898 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:47,898 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:47,898 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:47,898 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:47,898 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:47,964 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:47,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:47,987 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:47,989 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:47,989 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:47,990 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 13:02:48,057 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd222997/f8cdbab4b20643588bc9bd6678441c1b/FLAGe7f50b42a [2018-11-23 13:02:48,491 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:48,492 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum04_false-unreach-call_true-termination.i [2018-11-23 13:02:48,498 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd222997/f8cdbab4b20643588bc9bd6678441c1b/FLAGe7f50b42a [2018-11-23 13:02:48,865 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcd222997/f8cdbab4b20643588bc9bd6678441c1b [2018-11-23 13:02:48,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:48,876 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:48,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:48,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:48,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:48,883 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,886 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@966dc1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:48, skipping insertion in model container [2018-11-23 13:02:48,886 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:48" (1/1) ... [2018-11-23 13:02:48,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:48,919 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:49,100 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:49,106 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:49,127 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:49,146 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:49,146 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49 WrapperNode [2018-11-23 13:02:49,147 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:49,148 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:49,148 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:49,148 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:49,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,165 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,174 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:49,174 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:49,175 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:49,175 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:49,186 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,188 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,193 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,202 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,203 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (1/1) ... [2018-11-23 13:02:49,205 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:49,205 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:49,206 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:49,206 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:49,208 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (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-23 13:02:49,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:49,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:49,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:49,389 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:49,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:49,389 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:49,813 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:49,813 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:49,814 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:49 BoogieIcfgContainer [2018-11-23 13:02:49,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:49,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:49,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:49,818 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:49,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:48" (1/3) ... [2018-11-23 13:02:49,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d23847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:49, skipping insertion in model container [2018-11-23 13:02:49,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:49" (2/3) ... [2018-11-23 13:02:49,820 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18d23847 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:49, skipping insertion in model container [2018-11-23 13:02:49,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:49" (3/3) ... [2018-11-23 13:02:49,822 INFO L112 eAbstractionObserver]: Analyzing ICFG sum04_false-unreach-call_true-termination.i [2018-11-23 13:02:49,831 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:49,839 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:49,857 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:49,893 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:49,894 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:49,894 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:49,895 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:49,896 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:49,896 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:49,896 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:49,896 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:49,897 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:49,914 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:02:49,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:49,920 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:49,921 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:49,923 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:49,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:49,929 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:02:49,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:49,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:49,974 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:49,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,040 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:02:50,043 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:02:50,044 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2018-11-23 13:02:50,044 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret1 := main(); {22#true} is VALID [2018-11-23 13:02:50,045 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2018-11-23 13:02:50,046 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:02:50,046 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:02:50,047 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:02:50,047 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:02:50,047 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:02:50,050 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-23 13:02:50,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:50,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:50,058 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:50,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:50,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:50,119 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-23 13:02:50,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:50,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:50,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:50,130 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:02:50,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,215 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:02:50,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:50,215 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:50,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:50,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:50,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:50,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:50,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:50,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:02:50,441 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-23 13:02:50,453 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:02:50,453 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:02:50,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:50,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:02:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:02:50,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:50,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:50,577 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:50,577 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,580 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:50,581 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:50,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:50,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:50,581 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:50,582 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:50,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,590 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:50,590 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:50,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:50,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:50,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:50,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:50,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:02:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:02:50,599 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:02:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:50,599 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:02:50,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:50,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:50,600 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:50,600 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:50,602 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:50,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:50,603 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 13:02:50,603 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:50,603 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:50,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:50,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:50,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:50,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:50,677 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:02:50,678 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:02:50,678 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #37#return; {111#true} is VALID [2018-11-23 13:02:50,678 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret1 := main(); {111#true} is VALID [2018-11-23 13:02:50,679 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {113#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:50,688 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(<= main_~i~0 1)} assume !(~i~0 <= 8); {112#false} is VALID [2018-11-23 13:02:50,689 INFO L256 TraceCheckUtils]: 6: Hoare triple {112#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {112#false} is VALID [2018-11-23 13:02:50,689 INFO L273 TraceCheckUtils]: 7: Hoare triple {112#false} ~cond := #in~cond; {112#false} is VALID [2018-11-23 13:02:50,689 INFO L273 TraceCheckUtils]: 8: Hoare triple {112#false} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:02:50,690 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:02:50,690 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-23 13:02:50,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:50,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 13:02:50,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:02:50,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:50,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 13:02:50,754 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-23 13:02:50,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 13:02:50,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 13:02:50,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:50,755 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 3 states. [2018-11-23 13:02:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:50,915 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2018-11-23 13:02:50,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 13:02:50,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 13:02:50,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:50,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:50,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-23 13:02:50,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 13:02:50,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2018-11-23 13:02:50,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2018-11-23 13:02:51,075 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:51,076 INFO L225 Difference]: With dead ends: 24 [2018-11-23 13:02:51,077 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 13:02:51,078 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 13:02:51,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 13:02:51,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-11-23 13:02:51,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:51,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 15 states. [2018-11-23 13:02:51,091 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 15 states. [2018-11-23 13:02:51,091 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 15 states. [2018-11-23 13:02:51,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,093 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:02:51,094 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:02:51,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,095 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 16 states. [2018-11-23 13:02:51,095 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 16 states. [2018-11-23 13:02:51,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:51,098 INFO L93 Difference]: Finished difference Result 16 states and 17 transitions. [2018-11-23 13:02:51,098 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2018-11-23 13:02:51,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:51,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:51,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:51,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:51,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 13:02:51,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2018-11-23 13:02:51,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2018-11-23 13:02:51,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:51,101 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2018-11-23 13:02:51,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 13:02:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2018-11-23 13:02:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:02:51,102 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:51,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:51,103 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:51,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2018-11-23 13:02:51,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:51,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:51,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:51,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,210 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-23 13:02:51,210 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-23 13:02:51,210 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #37#return; {206#true} is VALID [2018-11-23 13:02:51,211 INFO L256 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret1 := main(); {206#true} is VALID [2018-11-23 13:02:51,211 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {208#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {208#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {208#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,216 INFO L273 TraceCheckUtils]: 6: Hoare triple {208#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {208#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:51,219 INFO L273 TraceCheckUtils]: 7: Hoare triple {208#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {209#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:51,220 INFO L273 TraceCheckUtils]: 8: Hoare triple {209#(<= main_~i~0 2)} assume !(~i~0 <= 8); {207#false} is VALID [2018-11-23 13:02:51,220 INFO L256 TraceCheckUtils]: 9: Hoare triple {207#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {207#false} is VALID [2018-11-23 13:02:51,221 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2018-11-23 13:02:51,221 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2018-11-23 13:02:51,221 INFO L273 TraceCheckUtils]: 12: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-23 13:02:51,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:51,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:51,224 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:51,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:51,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:51,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:51,375 INFO L256 TraceCheckUtils]: 0: Hoare triple {206#true} call ULTIMATE.init(); {206#true} is VALID [2018-11-23 13:02:51,375 INFO L273 TraceCheckUtils]: 1: Hoare triple {206#true} assume true; {206#true} is VALID [2018-11-23 13:02:51,375 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {206#true} {206#true} #37#return; {206#true} is VALID [2018-11-23 13:02:51,376 INFO L256 TraceCheckUtils]: 3: Hoare triple {206#true} call #t~ret1 := main(); {206#true} is VALID [2018-11-23 13:02:51,376 INFO L273 TraceCheckUtils]: 4: Hoare triple {206#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {206#true} is VALID [2018-11-23 13:02:51,376 INFO L273 TraceCheckUtils]: 5: Hoare triple {206#true} assume !!(~i~0 <= 8); {206#true} is VALID [2018-11-23 13:02:51,377 INFO L273 TraceCheckUtils]: 6: Hoare triple {206#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {231#(< main_~i~0 4)} is VALID [2018-11-23 13:02:51,378 INFO L273 TraceCheckUtils]: 7: Hoare triple {231#(< main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {235#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:51,378 INFO L273 TraceCheckUtils]: 8: Hoare triple {235#(<= main_~i~0 4)} assume !(~i~0 <= 8); {207#false} is VALID [2018-11-23 13:02:51,379 INFO L256 TraceCheckUtils]: 9: Hoare triple {207#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {207#false} is VALID [2018-11-23 13:02:51,379 INFO L273 TraceCheckUtils]: 10: Hoare triple {207#false} ~cond := #in~cond; {207#false} is VALID [2018-11-23 13:02:51,379 INFO L273 TraceCheckUtils]: 11: Hoare triple {207#false} assume 0 == ~cond; {207#false} is VALID [2018-11-23 13:02:51,380 INFO L273 TraceCheckUtils]: 12: Hoare triple {207#false} assume !false; {207#false} is VALID [2018-11-23 13:02:51,381 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:51,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:02:51,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2018-11-23 13:02:51,405 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:02:51,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:51,405 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 13:02:51,443 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-23 13:02:51,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 13:02:51,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 13:02:51,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:51,444 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 6 states. [2018-11-23 13:02:52,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,057 INFO L93 Difference]: Finished difference Result 33 states and 41 transitions. [2018-11-23 13:02:52,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 13:02:52,057 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 13 [2018-11-23 13:02:52,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 13:02:52,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 13:02:52,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2018-11-23 13:02:52,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2018-11-23 13:02:52,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,129 INFO L225 Difference]: With dead ends: 33 [2018-11-23 13:02:52,130 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 13:02:52,130 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:52,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 13:02:52,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2018-11-23 13:02:52,163 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:52,163 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 23 states. [2018-11-23 13:02:52,163 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 23 states. [2018-11-23 13:02:52,164 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 23 states. [2018-11-23 13:02:52,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,166 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:02:52,166 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:02:52,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,167 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 25 states. [2018-11-23 13:02:52,167 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 25 states. [2018-11-23 13:02:52,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:52,170 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2018-11-23 13:02:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-11-23 13:02:52,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:52,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:52,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:52,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:52,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 13:02:52,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-23 13:02:52,173 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 13 [2018-11-23 13:02:52,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:52,174 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-23 13:02:52,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 13:02:52,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-23 13:02:52,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:02:52,175 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:52,175 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:52,175 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:52,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:52,176 INFO L82 PathProgramCache]: Analyzing trace with hash -452912071, now seen corresponding path program 1 times [2018-11-23 13:02:52,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:52,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:52,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:52,178 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,368 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 13:02:52,368 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:02:52,369 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #37#return; {381#true} is VALID [2018-11-23 13:02:52,369 INFO L256 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret1 := main(); {381#true} is VALID [2018-11-23 13:02:52,369 INFO L273 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {381#true} is VALID [2018-11-23 13:02:52,369 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} assume !!(~i~0 <= 8); {381#true} is VALID [2018-11-23 13:02:52,370 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {381#true} is VALID [2018-11-23 13:02:52,370 INFO L273 TraceCheckUtils]: 7: Hoare triple {381#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {381#true} is VALID [2018-11-23 13:02:52,370 INFO L273 TraceCheckUtils]: 8: Hoare triple {381#true} assume !!(~i~0 <= 8); {381#true} is VALID [2018-11-23 13:02:52,371 INFO L273 TraceCheckUtils]: 9: Hoare triple {381#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {381#true} is VALID [2018-11-23 13:02:52,371 INFO L273 TraceCheckUtils]: 10: Hoare triple {381#true} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {381#true} is VALID [2018-11-23 13:02:52,371 INFO L273 TraceCheckUtils]: 11: Hoare triple {381#true} assume !!(~i~0 <= 8); {381#true} is VALID [2018-11-23 13:02:52,373 INFO L273 TraceCheckUtils]: 12: Hoare triple {381#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {383#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,374 INFO L273 TraceCheckUtils]: 13: Hoare triple {383#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,379 INFO L273 TraceCheckUtils]: 14: Hoare triple {384#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,382 INFO L273 TraceCheckUtils]: 15: Hoare triple {384#(<= main_~i~0 4)} assume !(~i~0 < 4); {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,384 INFO L273 TraceCheckUtils]: 16: Hoare triple {384#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {385#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {385#(<= main_~i~0 5)} assume !(~i~0 <= 8); {382#false} is VALID [2018-11-23 13:02:52,385 INFO L256 TraceCheckUtils]: 18: Hoare triple {382#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {382#false} is VALID [2018-11-23 13:02:52,385 INFO L273 TraceCheckUtils]: 19: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-23 13:02:52,385 INFO L273 TraceCheckUtils]: 20: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-23 13:02:52,386 INFO L273 TraceCheckUtils]: 21: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 13:02:52,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 13:02:52,387 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:52,387 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:52,396 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:52,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:52,434 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:52,713 INFO L256 TraceCheckUtils]: 0: Hoare triple {381#true} call ULTIMATE.init(); {381#true} is VALID [2018-11-23 13:02:52,713 INFO L273 TraceCheckUtils]: 1: Hoare triple {381#true} assume true; {381#true} is VALID [2018-11-23 13:02:52,714 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {381#true} {381#true} #37#return; {381#true} is VALID [2018-11-23 13:02:52,714 INFO L256 TraceCheckUtils]: 3: Hoare triple {381#true} call #t~ret1 := main(); {381#true} is VALID [2018-11-23 13:02:52,714 INFO L273 TraceCheckUtils]: 4: Hoare triple {381#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {381#true} is VALID [2018-11-23 13:02:52,715 INFO L273 TraceCheckUtils]: 5: Hoare triple {381#true} assume !!(~i~0 <= 8); {381#true} is VALID [2018-11-23 13:02:52,715 INFO L273 TraceCheckUtils]: 6: Hoare triple {381#true} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {383#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:52,720 INFO L273 TraceCheckUtils]: 7: Hoare triple {383#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,721 INFO L273 TraceCheckUtils]: 8: Hoare triple {384#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,722 INFO L273 TraceCheckUtils]: 9: Hoare triple {384#(<= main_~i~0 4)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {384#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:52,723 INFO L273 TraceCheckUtils]: 10: Hoare triple {384#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {385#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,723 INFO L273 TraceCheckUtils]: 11: Hoare triple {385#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {385#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,725 INFO L273 TraceCheckUtils]: 12: Hoare triple {385#(<= main_~i~0 5)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {385#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:52,726 INFO L273 TraceCheckUtils]: 13: Hoare triple {385#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {428#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,727 INFO L273 TraceCheckUtils]: 14: Hoare triple {428#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {428#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,727 INFO L273 TraceCheckUtils]: 15: Hoare triple {428#(<= main_~i~0 6)} assume !(~i~0 < 4); {428#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:52,729 INFO L273 TraceCheckUtils]: 16: Hoare triple {428#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {438#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:52,730 INFO L273 TraceCheckUtils]: 17: Hoare triple {438#(<= main_~i~0 7)} assume !(~i~0 <= 8); {382#false} is VALID [2018-11-23 13:02:52,730 INFO L256 TraceCheckUtils]: 18: Hoare triple {382#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {382#false} is VALID [2018-11-23 13:02:52,731 INFO L273 TraceCheckUtils]: 19: Hoare triple {382#false} ~cond := #in~cond; {382#false} is VALID [2018-11-23 13:02:52,731 INFO L273 TraceCheckUtils]: 20: Hoare triple {382#false} assume 0 == ~cond; {382#false} is VALID [2018-11-23 13:02:52,731 INFO L273 TraceCheckUtils]: 21: Hoare triple {382#false} assume !false; {382#false} is VALID [2018-11-23 13:02:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:52,752 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:52,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7] total 7 [2018-11-23 13:02:52,753 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:02:52,753 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:52,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 13:02:52,806 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:52,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:02:52,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:02:52,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:52,807 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 7 states. [2018-11-23 13:02:53,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,028 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2018-11-23 13:02:53,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:02:53,029 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2018-11-23 13:02:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:53,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-23 13:02:53,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 13:02:53,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2018-11-23 13:02:53,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2018-11-23 13:02:53,102 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,104 INFO L225 Difference]: With dead ends: 39 [2018-11-23 13:02:53,104 INFO L226 Difference]: Without dead ends: 34 [2018-11-23 13:02:53,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:02:53,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-23 13:02:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2018-11-23 13:02:53,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:53,143 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:53,143 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:53,144 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 32 states. [2018-11-23 13:02:53,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,147 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:02:53,147 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:02:53,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,148 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 34 states. [2018-11-23 13:02:53,148 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 34 states. [2018-11-23 13:02:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,151 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-11-23 13:02:53,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2018-11-23 13:02:53,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:53,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:53,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-11-23 13:02:53,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2018-11-23 13:02:53,155 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 22 [2018-11-23 13:02:53,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:53,155 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2018-11-23 13:02:53,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:02:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2018-11-23 13:02:53,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:02:53,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:53,157 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:53,157 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:53,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1902732141, now seen corresponding path program 2 times [2018-11-23 13:02:53,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:53,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:53,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:53,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2018-11-23 13:02:53,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2018-11-23 13:02:53,396 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #37#return; {622#true} is VALID [2018-11-23 13:02:53,397 INFO L256 TraceCheckUtils]: 3: Hoare triple {622#true} call #t~ret1 := main(); {622#true} is VALID [2018-11-23 13:02:53,399 INFO L273 TraceCheckUtils]: 4: Hoare triple {622#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,400 INFO L273 TraceCheckUtils]: 5: Hoare triple {624#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,400 INFO L273 TraceCheckUtils]: 6: Hoare triple {624#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,401 INFO L273 TraceCheckUtils]: 7: Hoare triple {624#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,402 INFO L273 TraceCheckUtils]: 8: Hoare triple {625#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,402 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,403 INFO L273 TraceCheckUtils]: 10: Hoare triple {625#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,404 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,405 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,406 INFO L273 TraceCheckUtils]: 13: Hoare triple {626#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,407 INFO L273 TraceCheckUtils]: 14: Hoare triple {627#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {627#(<= main_~i~0 4)} assume !(~i~0 < 4); {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,414 INFO L273 TraceCheckUtils]: 16: Hoare triple {627#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {628#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#(<= main_~i~0 5)} assume !(~i~0 < 4); {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,416 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,417 INFO L273 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,417 INFO L273 TraceCheckUtils]: 21: Hoare triple {629#(<= main_~i~0 6)} assume !(~i~0 < 4); {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,421 INFO L273 TraceCheckUtils]: 22: Hoare triple {629#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,422 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,422 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#(<= main_~i~0 7)} assume !(~i~0 < 4); {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,423 INFO L273 TraceCheckUtils]: 25: Hoare triple {630#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {631#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,424 INFO L273 TraceCheckUtils]: 26: Hoare triple {631#(<= main_~i~0 8)} assume !(~i~0 <= 8); {623#false} is VALID [2018-11-23 13:02:53,424 INFO L256 TraceCheckUtils]: 27: Hoare triple {623#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {623#false} is VALID [2018-11-23 13:02:53,424 INFO L273 TraceCheckUtils]: 28: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2018-11-23 13:02:53,424 INFO L273 TraceCheckUtils]: 29: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2018-11-23 13:02:53,425 INFO L273 TraceCheckUtils]: 30: Hoare triple {623#false} assume !false; {623#false} is VALID [2018-11-23 13:02:53,428 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:53,429 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:53,429 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 13:02:53,445 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:53,457 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:53,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:53,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:53,471 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:53,586 INFO L256 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2018-11-23 13:02:53,587 INFO L273 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2018-11-23 13:02:53,587 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #37#return; {622#true} is VALID [2018-11-23 13:02:53,588 INFO L256 TraceCheckUtils]: 3: Hoare triple {622#true} call #t~ret1 := main(); {622#true} is VALID [2018-11-23 13:02:53,589 INFO L273 TraceCheckUtils]: 4: Hoare triple {622#true} havoc ~i~0;~sn~0 := 0;~i~0 := 1; {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,589 INFO L273 TraceCheckUtils]: 5: Hoare triple {624#(<= main_~i~0 1)} assume !!(~i~0 <= 8); {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,591 INFO L273 TraceCheckUtils]: 6: Hoare triple {624#(<= main_~i~0 1)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {624#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:53,596 INFO L273 TraceCheckUtils]: 7: Hoare triple {624#(<= main_~i~0 1)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,597 INFO L273 TraceCheckUtils]: 8: Hoare triple {625#(<= main_~i~0 2)} assume !!(~i~0 <= 8); {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,597 INFO L273 TraceCheckUtils]: 9: Hoare triple {625#(<= main_~i~0 2)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {625#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:53,599 INFO L273 TraceCheckUtils]: 10: Hoare triple {625#(<= main_~i~0 2)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,599 INFO L273 TraceCheckUtils]: 11: Hoare triple {626#(<= main_~i~0 3)} assume !!(~i~0 <= 8); {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,600 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#(<= main_~i~0 3)} assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; {626#(<= main_~i~0 3)} is VALID [2018-11-23 13:02:53,602 INFO L273 TraceCheckUtils]: 13: Hoare triple {626#(<= main_~i~0 3)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,603 INFO L273 TraceCheckUtils]: 14: Hoare triple {627#(<= main_~i~0 4)} assume !!(~i~0 <= 8); {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,603 INFO L273 TraceCheckUtils]: 15: Hoare triple {627#(<= main_~i~0 4)} assume !(~i~0 < 4); {627#(<= main_~i~0 4)} is VALID [2018-11-23 13:02:53,605 INFO L273 TraceCheckUtils]: 16: Hoare triple {627#(<= main_~i~0 4)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,605 INFO L273 TraceCheckUtils]: 17: Hoare triple {628#(<= main_~i~0 5)} assume !!(~i~0 <= 8); {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,607 INFO L273 TraceCheckUtils]: 18: Hoare triple {628#(<= main_~i~0 5)} assume !(~i~0 < 4); {628#(<= main_~i~0 5)} is VALID [2018-11-23 13:02:53,608 INFO L273 TraceCheckUtils]: 19: Hoare triple {628#(<= main_~i~0 5)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,609 INFO L273 TraceCheckUtils]: 20: Hoare triple {629#(<= main_~i~0 6)} assume !!(~i~0 <= 8); {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,609 INFO L273 TraceCheckUtils]: 21: Hoare triple {629#(<= main_~i~0 6)} assume !(~i~0 < 4); {629#(<= main_~i~0 6)} is VALID [2018-11-23 13:02:53,611 INFO L273 TraceCheckUtils]: 22: Hoare triple {629#(<= main_~i~0 6)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,611 INFO L273 TraceCheckUtils]: 23: Hoare triple {630#(<= main_~i~0 7)} assume !!(~i~0 <= 8); {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,613 INFO L273 TraceCheckUtils]: 24: Hoare triple {630#(<= main_~i~0 7)} assume !(~i~0 < 4); {630#(<= main_~i~0 7)} is VALID [2018-11-23 13:02:53,614 INFO L273 TraceCheckUtils]: 25: Hoare triple {630#(<= main_~i~0 7)} #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; {631#(<= main_~i~0 8)} is VALID [2018-11-23 13:02:53,615 INFO L273 TraceCheckUtils]: 26: Hoare triple {631#(<= main_~i~0 8)} assume !(~i~0 <= 8); {623#false} is VALID [2018-11-23 13:02:53,615 INFO L256 TraceCheckUtils]: 27: Hoare triple {623#false} call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); {623#false} is VALID [2018-11-23 13:02:53,615 INFO L273 TraceCheckUtils]: 28: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2018-11-23 13:02:53,616 INFO L273 TraceCheckUtils]: 29: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2018-11-23 13:02:53,616 INFO L273 TraceCheckUtils]: 30: Hoare triple {623#false} assume !false; {623#false} is VALID [2018-11-23 13:02:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:53,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:53,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2018-11-23 13:02:53,643 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 13:02:53,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:53,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 13:02:53,690 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,691 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 13:02:53,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 13:02:53,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:02:53,691 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand 10 states. [2018-11-23 13:02:53,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,882 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-11-23 13:02:53,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 13:02:53,883 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 31 [2018-11-23 13:02:53,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:53,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:02:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-23 13:02:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 13:02:53,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 45 transitions. [2018-11-23 13:02:53,889 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 45 transitions. [2018-11-23 13:02:53,948 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:53,951 INFO L225 Difference]: With dead ends: 40 [2018-11-23 13:02:53,952 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 13:02:53,952 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:02:53,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 13:02:53,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-11-23 13:02:53,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:53,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 35 states. [2018-11-23 13:02:53,977 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 13:02:53,977 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 13:02:53,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,980 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 13:02:53,980 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 13:02:53,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,981 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 35 states. [2018-11-23 13:02:53,981 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 35 states. [2018-11-23 13:02:53,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:53,984 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2018-11-23 13:02:53,984 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 13:02:53,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:53,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:53,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:53,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:53,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-23 13:02:53,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2018-11-23 13:02:53,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 31 [2018-11-23 13:02:53,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:53,988 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2018-11-23 13:02:53,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 13:02:53,988 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2018-11-23 13:02:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 13:02:53,990 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:53,990 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 5, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:53,990 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:53,990 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:53,991 INFO L82 PathProgramCache]: Analyzing trace with hash 749989817, now seen corresponding path program 3 times [2018-11-23 13:02:53,991 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:53,991 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:53,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:53,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:54,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:54,044 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=1, main_~sn~0=0] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~sn~0=2] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, main_~sn~0=2] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=2, main_~sn~0=2] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~sn~0=4] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, main_~sn~0=4] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=3, main_~sn~0=4] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=4, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=4, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=5, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=5, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=6, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=6, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=7, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=7, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=8, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=8, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, main_~sn~0=6] [?] assume !(~i~0 <= 8); VAL [main_~i~0=9, main_~sn~0=6] [?] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:54,090 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:54,090 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:54,090 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:54,091 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2018-11-23 13:02:54,092 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:54,093 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:54,093 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2018-11-23 13:02:54,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:54 BoogieIcfgContainer [2018-11-23 13:02:54,096 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:54,096 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:54,097 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:54,097 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:54,097 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:49" (3/4) ... [2018-11-23 13:02:54,100 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #37#return; [?] CALL call #t~ret1 := main(); [?] havoc ~i~0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~sn~0=0] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=1, main_~sn~0=0] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~sn~0=2] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=2, main_~sn~0=2] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=2, main_~sn~0=2] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~sn~0=4] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=3, main_~sn~0=4] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=3, main_~sn~0=4] [?] assume ~i~0 < 4;~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=4, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=4, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=5, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=5, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=5, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=6, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=6, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=6, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=7, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=7, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=7, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=8, main_~sn~0=6] [?] assume !!(~i~0 <= 8); VAL [main_~i~0=8, main_~sn~0=6] [?] assume !(~i~0 < 4); VAL [main_~i~0=8, main_~sn~0=6] [?] #t~post0 := ~i~0;~i~0 := 1 + #t~post0;havoc #t~post0; VAL [main_~i~0=9, main_~sn~0=6] [?] assume !(~i~0 <= 8); VAL [main_~i~0=9, main_~sn~0=6] [?] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [|__VERIFIER_assert_#in~cond|=0] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume 0 == ~cond; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] assume !false; VAL [__VERIFIER_assert_~cond=0, |__VERIFIER_assert_#in~cond|=0] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=1, ~sn~0=0] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=2, ~sn~0=2] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=3, ~sn~0=4] [L14-L15] assume ~i~0 < 4; [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=4, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=5, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=6, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=7, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] assume !!(~i~0 <= 8); VAL [~i~0=8, ~sn~0=6] [L14-L15] assume !(~i~0 < 4); VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] assume !(~i~0 <= 8); VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4-L6] assume 0 == ~cond; VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret1 := main(); [L12] havoc ~i~0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=1, ~sn~0=0] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~sn~0=2] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=2, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=2, ~sn~0=2] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~sn~0=4] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=3, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=3, ~sn~0=4] [L14] COND TRUE ~i~0 < 4 [L15] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=4, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=4, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=5, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=5, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=5, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=6, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=6, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=6, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=7, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=7, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=7, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=8, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= 8)) VAL [~i~0=8, ~sn~0=6] [L14] COND FALSE !(~i~0 < 4) VAL [~i~0=8, ~sn~0=6] [L13] #t~post0 := ~i~0; [L13] ~i~0 := 1 + #t~post0; [L13] havoc #t~post0; VAL [~i~0=9, ~sn~0=6] [L13-L16] COND TRUE !(~i~0 <= 8) VAL [~i~0=9, ~sn~0=6] [L17] CALL call __VERIFIER_assert((if 16 == ~sn~0 || 0 == ~sn~0 then 1 else 0)); VAL [#in~cond=0] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0, ~cond=0] [L4] COND TRUE 0 == ~cond VAL [#in~cond=0, ~cond=0] [L5] assert false; VAL [#in~cond=0, ~cond=0] [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] ----- [2018-11-23 13:02:54,173 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum04_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:54,173 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:54,175 INFO L168 Benchmark]: Toolchain (without parser) took 5299.75 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -513.3 MB). Peak memory consumption was 253.8 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,177 INFO L168 Benchmark]: CDTParser took 0.20 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-23 13:02:54,178 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.20 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-23 13:02:54,179 INFO L168 Benchmark]: Boogie Procedure Inliner took 26.19 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-23 13:02:54,179 INFO L168 Benchmark]: Boogie Preprocessor took 30.76 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-23 13:02:54,180 INFO L168 Benchmark]: RCFGBuilder took 608.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,181 INFO L168 Benchmark]: TraceAbstraction took 4281.44 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: 282.3 MB). Peak memory consumption was 282.3 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:54,182 INFO L168 Benchmark]: Witness Printer took 77.19 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:54,186 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.20 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 270.20 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 Procedure Inliner took 26.19 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. * Boogie Preprocessor took 30.76 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 608.41 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 767.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -806.1 MB). Peak memory consumption was 26.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4281.44 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: 282.3 MB). Peak memory consumption was 282.3 MB. Max. memory is 7.1 GB. * Witness Printer took 77.19 ms. Allocated memory is still 2.3 GB. Free memory is still 1.9 GB. There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, sn=0; [L13] i=1 VAL [i=1, sn=0] [L13] COND TRUE i<=8 VAL [i=1, sn=0] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=1, sn=2] [L13] i++ VAL [i=2, sn=2] [L13] COND TRUE i<=8 VAL [i=2, sn=2] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=2, sn=4] [L13] i++ VAL [i=3, sn=4] [L13] COND TRUE i<=8 VAL [i=3, sn=4] [L14] COND TRUE i<4 [L15] sn = sn + (2) VAL [i=3, sn=6] [L13] i++ VAL [i=4, sn=6] [L13] COND TRUE i<=8 VAL [i=4, sn=6] [L14] COND FALSE !(i<4) VAL [i=4, sn=6] [L13] i++ VAL [i=5, sn=6] [L13] COND TRUE i<=8 VAL [i=5, sn=6] [L14] COND FALSE !(i<4) VAL [i=5, sn=6] [L13] i++ VAL [i=6, sn=6] [L13] COND TRUE i<=8 VAL [i=6, sn=6] [L14] COND FALSE !(i<4) VAL [i=6, sn=6] [L13] i++ VAL [i=7, sn=6] [L13] COND TRUE i<=8 VAL [i=7, sn=6] [L14] COND FALSE !(i<4) VAL [i=7, sn=6] [L13] i++ VAL [i=8, sn=6] [L13] COND TRUE i<=8 VAL [i=8, sn=6] [L14] COND FALSE !(i<4) VAL [i=8, sn=6] [L13] i++ VAL [i=9, sn=6] [L13] COND FALSE !(i<=8) VAL [i=9, sn=6] [L17] CALL __VERIFIER_assert(sn==8*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. UNSAFE Result, 4.2s OverallTime, 6 OverallIterations, 8 TraceHistogramMax, 1.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 41 SDslu, 128 SDs, 0 SdLazy, 88 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=5, 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.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 5 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 186 NumberOfCodeBlocks, 186 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 144 ConstructedInterpolants, 0 QuantifiedInterpolants, 6606 SizeOfPredicates, 2 NumberOfNonLiveVariables, 134 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 8 InterpolantComputations, 3 PerfectInterpolantSequences, 28/186 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...