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/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:02:37,875 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:02:37,877 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:02:37,890 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:02:37,890 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:02:37,892 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:02:37,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:02:37,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:02:37,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:02:37,909 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:02:37,910 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:02:37,910 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:02:37,911 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:02:37,912 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:02:37,913 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:02:37,914 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:02:37,915 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:02:37,916 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:02:37,918 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:02:37,921 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:02:37,923 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:02:37,924 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:02:37,927 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:02:37,927 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:02:37,928 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:02:37,931 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:02:37,932 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:02:37,933 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:02:37,933 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:02:37,936 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:02:37,936 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:02:37,938 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:02:37,938 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:02:37,938 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:02:37,939 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:02:37,942 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:02:37,942 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:37,964 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:02:37,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:02:37,966 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:02:37,966 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:02:37,966 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:02:37,967 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:02:37,967 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:02:37,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:02:37,968 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:02:37,968 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:02:37,968 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:02:37,968 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:02:37,968 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:02:37,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:02:37,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:02:37,969 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:02:37,969 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:02:37,970 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:02:37,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:02:37,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:02:37,970 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:02:37,970 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:02:37,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:02:37,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:02:37,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:02:37,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:02:37,971 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:02:37,972 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:02:37,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:02:37,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:02:37,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:02:38,023 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:02:38,035 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:02:38,040 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:02:38,042 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:02:38,042 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:02:38,043 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 13:02:38,125 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc4505b7/71acbccadb5643b8aa4c4685cea2bfba/FLAGff8bf9e2a [2018-11-23 13:02:38,554 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:02:38,555 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 13:02:38,560 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc4505b7/71acbccadb5643b8aa4c4685cea2bfba/FLAGff8bf9e2a [2018-11-23 13:02:38,930 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fcc4505b7/71acbccadb5643b8aa4c4685cea2bfba [2018-11-23 13:02:38,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:02:38,941 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:02:38,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:38,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:02:38,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:02:38,948 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:38" (1/1) ... [2018-11-23 13:02:38,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50669a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:38, skipping insertion in model container [2018-11-23 13:02:38,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:02:38" (1/1) ... [2018-11-23 13:02:38,962 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:02:38,986 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:02:39,253 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:39,260 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:02:39,283 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:02:39,301 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:02:39,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:39 WrapperNode [2018-11-23 13:02:39,302 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:02:39,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:39,303 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:02:39,303 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:02:39,315 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:39" (1/1) ... [2018-11-23 13:02:39,323 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:39" (1/1) ... [2018-11-23 13:02:39,332 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:02:39,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:02:39,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:02:39,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:02:39,344 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:39" (1/1) ... [2018-11-23 13:02:39,344 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:39" (1/1) ... [2018-11-23 13:02:39,345 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:39" (1/1) ... [2018-11-23 13:02:39,345 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:39" (1/1) ... [2018-11-23 13:02:39,353 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:39" (1/1) ... [2018-11-23 13:02:39,361 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:39" (1/1) ... [2018-11-23 13:02:39,362 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:39" (1/1) ... [2018-11-23 13:02:39,363 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:02:39,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:02:39,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:02:39,364 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:02:39,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:39" (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:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:02:39,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:02:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:02:39,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:02:39,530 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:02:39,531 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:02:39,531 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 13:02:39,531 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 13:02:40,084 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:02:40,085 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 13:02:40,085 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:40 BoogieIcfgContainer [2018-11-23 13:02:40,085 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:02:40,086 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:02:40,086 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:02:40,089 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:02:40,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:02:38" (1/3) ... [2018-11-23 13:02:40,090 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3dee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:40, skipping insertion in model container [2018-11-23 13:02:40,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:02:39" (2/3) ... [2018-11-23 13:02:40,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d3dee25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:02:40, skipping insertion in model container [2018-11-23 13:02:40,091 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:02:40" (3/3) ... [2018-11-23 13:02:40,093 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i [2018-11-23 13:02:40,101 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:02:40,113 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:02:40,132 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:02:40,165 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:02:40,166 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:02:40,166 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:02:40,166 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:02:40,167 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:02:40,167 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:02:40,167 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:02:40,167 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:02:40,168 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:02:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 13:02:40,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:40,197 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:40,198 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:40,201 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:40,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:40,207 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2018-11-23 13:02:40,209 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:40,210 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:40,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:40,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:40,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:40,347 INFO L256 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2018-11-23 13:02:40,350 INFO L273 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2018-11-23 13:02:40,351 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2018-11-23 13:02:40,352 INFO L256 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2018-11-23 13:02:40,352 INFO L273 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2018-11-23 13:02:40,370 INFO L273 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2018-11-23 13:02:40,371 INFO L256 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2018-11-23 13:02:40,371 INFO L273 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2018-11-23 13:02:40,371 INFO L273 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2018-11-23 13:02:40,372 INFO L273 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2018-11-23 13:02:40,374 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:40,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:40,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:02:40,382 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:40,385 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:40,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 13:02:40,449 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:40,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:02:40,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:02:40,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:02:40,461 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2018-11-23 13:02:40,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:40,552 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2018-11-23 13:02:40,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:02:40,553 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 13:02:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:40,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:40,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:40,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 13:02:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2018-11-23 13:02:40,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2018-11-23 13:02:40,755 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:40,766 INFO L225 Difference]: With dead ends: 30 [2018-11-23 13:02:40,767 INFO L226 Difference]: Without dead ends: 13 [2018-11-23 13:02:40,771 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:40,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-11-23 13:02:40,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-11-23 13:02:40,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:40,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:40,888 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:40,888 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:40,892 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:40,892 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:40,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:40,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:40,893 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:40,893 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2018-11-23 13:02:40,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:40,896 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2018-11-23 13:02:40,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:40,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:40,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:40,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:40,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:40,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 13:02:40,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2018-11-23 13:02:40,901 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2018-11-23 13:02:40,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:40,902 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2018-11-23 13:02:40,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:02:40,902 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2018-11-23 13:02:40,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 13:02:40,903 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:40,903 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:40,903 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:40,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:40,904 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2018-11-23 13:02:40,904 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:40,904 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:40,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:40,906 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:40,906 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:41,101 INFO L256 TraceCheckUtils]: 0: Hoare triple {111#true} call ULTIMATE.init(); {111#true} is VALID [2018-11-23 13:02:41,101 INFO L273 TraceCheckUtils]: 1: Hoare triple {111#true} assume true; {111#true} is VALID [2018-11-23 13:02:41,102 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {111#true} {111#true} #37#return; {111#true} is VALID [2018-11-23 13:02:41,102 INFO L256 TraceCheckUtils]: 3: Hoare triple {111#true} call #t~ret2 := main(); {111#true} is VALID [2018-11-23 13:02:41,111 INFO L273 TraceCheckUtils]: 4: Hoare triple {111#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:41,128 INFO L273 TraceCheckUtils]: 5: Hoare triple {113#(= main_~sn~0 0)} assume !(~i~0 <= ~n~0); {113#(= main_~sn~0 0)} is VALID [2018-11-23 13:02:41,138 INFO L256 TraceCheckUtils]: 6: Hoare triple {113#(= main_~sn~0 0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {114#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2018-11-23 13:02:41,147 INFO L273 TraceCheckUtils]: 7: Hoare triple {114#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {115#(= 1 __VERIFIER_assert_~cond)} is VALID [2018-11-23 13:02:41,148 INFO L273 TraceCheckUtils]: 8: Hoare triple {115#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {112#false} is VALID [2018-11-23 13:02:41,148 INFO L273 TraceCheckUtils]: 9: Hoare triple {112#false} assume !false; {112#false} is VALID [2018-11-23 13:02:41,149 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:41,149 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:02:41,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:02:41,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:41,151 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:41,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:02:41,197 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:41,197 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:02:41,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:02:41,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:02:41,199 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2018-11-23 13:02:41,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,514 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 13:02:41,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:02:41,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 13:02:41,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:41,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:41,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:02:41,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:02:41,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-23 13:02:41,520 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 20 transitions. [2018-11-23 13:02:41,565 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:41,567 INFO L225 Difference]: With dead ends: 19 [2018-11-23 13:02:41,567 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 13:02:41,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:02:41,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 13:02:41,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 13:02:41,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:41,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 13:02:41,584 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:02:41,584 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:02:41,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,586 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:02:41,586 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:02:41,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:41,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:41,587 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 13:02:41,587 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 13:02:41,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:41,589 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 13:02:41,589 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:02:41,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:41,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:41,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:41,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:41,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 13:02:41,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 13:02:41,592 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 13:02:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:41,592 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 13:02:41,592 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:02:41,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 13:02:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 13:02:41,593 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:41,594 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:41,594 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:41,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash 137668885, now seen corresponding path program 1 times [2018-11-23 13:02:41,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:41,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:41,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:41,596 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:41,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:41,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:42,175 WARN L180 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 14 [2018-11-23 13:02:42,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 13:02:42,428 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 13:02:42,428 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {199#true} {199#true} #37#return; {199#true} is VALID [2018-11-23 13:02:42,429 INFO L256 TraceCheckUtils]: 3: Hoare triple {199#true} call #t~ret2 := main(); {199#true} is VALID [2018-11-23 13:02:42,434 INFO L273 TraceCheckUtils]: 4: Hoare triple {199#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {201#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:42,435 INFO L273 TraceCheckUtils]: 5: Hoare triple {201#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {202#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:02:42,436 INFO L273 TraceCheckUtils]: 6: Hoare triple {202#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} assume !(4 == ~i~0); {202#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:02:42,437 INFO L273 TraceCheckUtils]: 7: Hoare triple {202#(and (or (<= (* 2 main_~i~0) main_~sn~0) (< (* 2 main_~n~0) (+ main_~sn~0 1))) (<= main_~sn~0 (* 2 main_~n~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {203#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (< (* 2 main_~n~0) (+ main_~sn~0 1)) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:02:42,439 INFO L273 TraceCheckUtils]: 8: Hoare triple {203#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (< (* 2 main_~n~0) (+ main_~sn~0 1)) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {204#(and (<= (* 2 main_~n~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~n~0)))} is VALID [2018-11-23 13:02:42,440 INFO L256 TraceCheckUtils]: 9: Hoare triple {204#(and (<= (* 2 main_~n~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {205#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:42,442 INFO L273 TraceCheckUtils]: 10: Hoare triple {205#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {206#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:42,444 INFO L273 TraceCheckUtils]: 11: Hoare triple {206#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {200#false} is VALID [2018-11-23 13:02:42,444 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 13:02:42,447 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:42,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:42,448 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:42,464 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:42,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:42,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:42,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:42,819 INFO L256 TraceCheckUtils]: 0: Hoare triple {199#true} call ULTIMATE.init(); {199#true} is VALID [2018-11-23 13:02:42,820 INFO L273 TraceCheckUtils]: 1: Hoare triple {199#true} assume true; {199#true} is VALID [2018-11-23 13:02:42,820 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {199#true} {199#true} #37#return; {199#true} is VALID [2018-11-23 13:02:42,820 INFO L256 TraceCheckUtils]: 3: Hoare triple {199#true} call #t~ret2 := main(); {199#true} is VALID [2018-11-23 13:02:42,821 INFO L273 TraceCheckUtils]: 4: Hoare triple {199#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {222#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:42,824 INFO L273 TraceCheckUtils]: 5: Hoare triple {222#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {226#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:42,827 INFO L273 TraceCheckUtils]: 6: Hoare triple {226#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} assume !(4 == ~i~0); {226#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:42,828 INFO L273 TraceCheckUtils]: 7: Hoare triple {226#(and (<= main_~i~0 main_~n~0) (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {233#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:42,828 INFO L273 TraceCheckUtils]: 8: Hoare triple {233#(and (<= main_~i~0 2) (<= 1 main_~n~0) (= 2 main_~sn~0))} assume !(~i~0 <= ~n~0); {237#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:42,829 INFO L256 TraceCheckUtils]: 9: Hoare triple {237#(and (<= 1 main_~n~0) (<= main_~n~0 1) (= 2 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {205#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:42,830 INFO L273 TraceCheckUtils]: 10: Hoare triple {205#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {206#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:42,832 INFO L273 TraceCheckUtils]: 11: Hoare triple {206#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {200#false} is VALID [2018-11-23 13:02:42,832 INFO L273 TraceCheckUtils]: 12: Hoare triple {200#false} assume !false; {200#false} is VALID [2018-11-23 13:02:42,834 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:42,856 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:42,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2018-11-23 13:02:42,857 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-23 13:02:42,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:42,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 13:02:42,973 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:42,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:02:42,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:02:42,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:02:42,974 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 12 states. [2018-11-23 13:02:43,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,616 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2018-11-23 13:02:43,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 13:02:43,616 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 13 [2018-11-23 13:02:43,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:43,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:02:43,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:02:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 13:02:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 38 transitions. [2018-11-23 13:02:43,622 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 38 transitions. [2018-11-23 13:02:43,678 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:43,680 INFO L225 Difference]: With dead ends: 32 [2018-11-23 13:02:43,681 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:02:43,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2018-11-23 13:02:43,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:02:43,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:02:43,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:43,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:43,699 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:43,699 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:43,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,701 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:02:43,701 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:02:43,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,702 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:43,702 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:43,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:43,705 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2018-11-23 13:02:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:02:43,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:43,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:43,706 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:43,706 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:43,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:02:43,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-11-23 13:02:43,708 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 13 [2018-11-23 13:02:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:43,708 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-11-23 13:02:43,708 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:02:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-11-23 13:02:43,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-23 13:02:43,709 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:43,709 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:43,710 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:43,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:43,710 INFO L82 PathProgramCache]: Analyzing trace with hash -2110192267, now seen corresponding path program 1 times [2018-11-23 13:02:43,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:43,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:43,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:43,712 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,793 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 13:02:43,793 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:02:43,793 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {373#true} {373#true} #37#return; {373#true} is VALID [2018-11-23 13:02:43,794 INFO L256 TraceCheckUtils]: 3: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-23 13:02:43,795 INFO L273 TraceCheckUtils]: 4: Hoare triple {373#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,798 INFO L273 TraceCheckUtils]: 5: Hoare triple {375#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,800 INFO L273 TraceCheckUtils]: 6: Hoare triple {375#(<= main_~i~0 1)} assume !(4 == ~i~0); {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {375#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {376#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,803 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {376#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,806 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {374#false} is VALID [2018-11-23 13:02:43,806 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {374#false} is VALID [2018-11-23 13:02:43,806 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} assume !(~i~0 <= ~n~0); {374#false} is VALID [2018-11-23 13:02:43,806 INFO L256 TraceCheckUtils]: 12: Hoare triple {374#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {374#false} is VALID [2018-11-23 13:02:43,807 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 13:02:43,807 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} assume 0 == ~cond; {374#false} is VALID [2018-11-23 13:02:43,807 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 13:02:43,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:43,808 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:43,808 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:43,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:43,841 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:43,952 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 13:02:43,953 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:02:43,953 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {373#true} {373#true} #37#return; {373#true} is VALID [2018-11-23 13:02:43,954 INFO L256 TraceCheckUtils]: 3: Hoare triple {373#true} call #t~ret2 := main(); {373#true} is VALID [2018-11-23 13:02:43,962 INFO L273 TraceCheckUtils]: 4: Hoare triple {373#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,964 INFO L273 TraceCheckUtils]: 5: Hoare triple {375#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,966 INFO L273 TraceCheckUtils]: 6: Hoare triple {375#(<= main_~i~0 1)} assume !(4 == ~i~0); {375#(<= main_~i~0 1)} is VALID [2018-11-23 13:02:43,967 INFO L273 TraceCheckUtils]: 7: Hoare triple {375#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {376#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,968 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {376#(<= main_~i~0 2)} is VALID [2018-11-23 13:02:43,968 INFO L273 TraceCheckUtils]: 9: Hoare triple {376#(<= main_~i~0 2)} assume 4 == ~i~0;~sn~0 := -10; {374#false} is VALID [2018-11-23 13:02:43,968 INFO L273 TraceCheckUtils]: 10: Hoare triple {374#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {374#false} is VALID [2018-11-23 13:02:43,969 INFO L273 TraceCheckUtils]: 11: Hoare triple {374#false} assume !(~i~0 <= ~n~0); {374#false} is VALID [2018-11-23 13:02:43,969 INFO L256 TraceCheckUtils]: 12: Hoare triple {374#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {374#false} is VALID [2018-11-23 13:02:43,969 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} ~cond := #in~cond; {374#false} is VALID [2018-11-23 13:02:43,969 INFO L273 TraceCheckUtils]: 14: Hoare triple {374#false} assume 0 == ~cond; {374#false} is VALID [2018-11-23 13:02:43,970 INFO L273 TraceCheckUtils]: 15: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 13:02:43,970 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:43,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:43,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2018-11-23 13:02:43,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 13:02:43,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:43,990 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:02:44,008 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:44,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:02:44,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:02:44,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:44,009 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2018-11-23 13:02:44,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,152 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 13:02:44,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:02:44,153 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-11-23 13:02:44,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:44,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:44,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 13:02:44,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:02:44,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2018-11-23 13:02:44,158 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2018-11-23 13:02:44,242 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:44,244 INFO L225 Difference]: With dead ends: 28 [2018-11-23 13:02:44,244 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 13:02:44,244 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:02:44,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 13:02:44,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-23 13:02:44,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:44,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:44,273 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:44,273 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:44,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,275 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:02:44,275 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:02:44,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,276 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:44,276 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-23 13:02:44,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:44,278 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-23 13:02:44,278 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:02:44,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:44,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:44,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:44,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:44,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 13:02:44,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 13:02:44,281 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 16 [2018-11-23 13:02:44,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:44,281 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 13:02:44,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:02:44,281 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 13:02:44,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 13:02:44,282 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:44,282 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:44,283 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:44,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:44,283 INFO L82 PathProgramCache]: Analyzing trace with hash 370288085, now seen corresponding path program 2 times [2018-11-23 13:02:44,283 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:44,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:02:44,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:44,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:44,583 INFO L256 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {535#true} is VALID [2018-11-23 13:02:44,584 INFO L273 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 13:02:44,584 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #37#return; {535#true} is VALID [2018-11-23 13:02:44,585 INFO L256 TraceCheckUtils]: 3: Hoare triple {535#true} call #t~ret2 := main(); {535#true} is VALID [2018-11-23 13:02:44,587 INFO L273 TraceCheckUtils]: 4: Hoare triple {535#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:44,588 INFO L273 TraceCheckUtils]: 5: Hoare triple {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:44,589 INFO L273 TraceCheckUtils]: 6: Hoare triple {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} assume !(4 == ~i~0); {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:44,590 INFO L273 TraceCheckUtils]: 7: Hoare triple {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:44,592 INFO L273 TraceCheckUtils]: 8: Hoare triple {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:44,593 INFO L273 TraceCheckUtils]: 9: Hoare triple {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} assume !(4 == ~i~0); {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} is VALID [2018-11-23 13:02:44,595 INFO L273 TraceCheckUtils]: 10: Hoare triple {538#(and (<= (* 2 main_~i~0) main_~sn~0) (<= main_~sn~0 (* 2 main_~i~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2018-11-23 13:02:44,596 INFO L273 TraceCheckUtils]: 11: Hoare triple {537#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {539#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:02:44,597 INFO L273 TraceCheckUtils]: 12: Hoare triple {539#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} assume !(4 == ~i~0); {539#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} is VALID [2018-11-23 13:02:44,598 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~i~0) main_~sn~0) (<= (* 2 main_~n~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {540#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2018-11-23 13:02:44,599 INFO L273 TraceCheckUtils]: 14: Hoare triple {540#(and (< main_~sn~0 (+ (* 2 main_~n~0) 1)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {541#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} is VALID [2018-11-23 13:02:44,601 INFO L256 TraceCheckUtils]: 15: Hoare triple {541#(and (<= (* 2 main_~n~0) main_~sn~0) (< main_~sn~0 (+ (* 2 main_~n~0) 1)))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {542#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:44,602 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {543#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:44,603 INFO L273 TraceCheckUtils]: 17: Hoare triple {543#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {536#false} is VALID [2018-11-23 13:02:44,603 INFO L273 TraceCheckUtils]: 18: Hoare triple {536#false} assume !false; {536#false} is VALID [2018-11-23 13:02:44,605 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-23 13:02:44,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:02:44,606 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:44,615 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:02:44,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 13:02:44,626 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:02:44,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:02:44,639 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:02:45,008 INFO L256 TraceCheckUtils]: 0: Hoare triple {535#true} call ULTIMATE.init(); {535#true} is VALID [2018-11-23 13:02:45,009 INFO L273 TraceCheckUtils]: 1: Hoare triple {535#true} assume true; {535#true} is VALID [2018-11-23 13:02:45,009 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {535#true} {535#true} #37#return; {535#true} is VALID [2018-11-23 13:02:45,009 INFO L256 TraceCheckUtils]: 3: Hoare triple {535#true} call #t~ret2 := main(); {535#true} is VALID [2018-11-23 13:02:45,011 INFO L273 TraceCheckUtils]: 4: Hoare triple {535#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {559#(and (= main_~i~0 1) (= 0 main_~sn~0))} is VALID [2018-11-23 13:02:45,012 INFO L273 TraceCheckUtils]: 5: Hoare triple {559#(and (= main_~i~0 1) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {563#(and (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,012 INFO L273 TraceCheckUtils]: 6: Hoare triple {563#(and (= main_~i~0 1) (= 2 main_~sn~0))} assume !(4 == ~i~0); {563#(and (= main_~i~0 1) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,014 INFO L273 TraceCheckUtils]: 7: Hoare triple {563#(and (= main_~i~0 1) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {570#(and (= main_~i~0 2) (= 2 main_~sn~0))} is VALID [2018-11-23 13:02:45,021 INFO L273 TraceCheckUtils]: 8: Hoare triple {570#(and (= main_~i~0 2) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {574#(and (= 4 main_~sn~0) (= main_~i~0 2))} is VALID [2018-11-23 13:02:45,022 INFO L273 TraceCheckUtils]: 9: Hoare triple {574#(and (= 4 main_~sn~0) (= main_~i~0 2))} assume !(4 == ~i~0); {574#(and (= 4 main_~sn~0) (= main_~i~0 2))} is VALID [2018-11-23 13:02:45,023 INFO L273 TraceCheckUtils]: 10: Hoare triple {574#(and (= 4 main_~sn~0) (= main_~i~0 2))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {581#(and (= 4 main_~sn~0) (= main_~i~0 3))} is VALID [2018-11-23 13:02:45,026 INFO L273 TraceCheckUtils]: 11: Hoare triple {581#(and (= 4 main_~sn~0) (= main_~i~0 3))} assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; {585#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:45,026 INFO L273 TraceCheckUtils]: 12: Hoare triple {585#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} assume !(4 == ~i~0); {585#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:45,028 INFO L273 TraceCheckUtils]: 13: Hoare triple {585#(and (= main_~i~0 3) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {592#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:45,029 INFO L273 TraceCheckUtils]: 14: Hoare triple {592#(and (<= 3 main_~n~0) (<= main_~i~0 4) (= 6 main_~sn~0))} assume !(~i~0 <= ~n~0); {596#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} is VALID [2018-11-23 13:02:45,030 INFO L256 TraceCheckUtils]: 15: Hoare triple {596#(and (<= 3 main_~n~0) (<= main_~n~0 3) (= 6 main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {542#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 13:02:45,031 INFO L273 TraceCheckUtils]: 16: Hoare triple {542#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {543#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 13:02:45,032 INFO L273 TraceCheckUtils]: 17: Hoare triple {543#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {536#false} is VALID [2018-11-23 13:02:45,033 INFO L273 TraceCheckUtils]: 18: Hoare triple {536#false} assume !false; {536#false} is VALID [2018-11-23 13:02:45,035 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:02:45,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:02:45,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12] total 17 [2018-11-23 13:02:45,060 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:02:45,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:02:45,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 13:02:45,102 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:45,102 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 13:02:45,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 13:02:45,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=225, Unknown=0, NotChecked=0, Total=272 [2018-11-23 13:02:45,103 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 17 states. [2018-11-23 13:02:46,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,264 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-11-23 13:02:46,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 13:02:46,265 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 19 [2018-11-23 13:02:46,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:02:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:02:46,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 13:02:46,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 13:02:46,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 44 transitions. [2018-11-23 13:02:46,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 44 transitions. [2018-11-23 13:02:46,331 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:02:46,332 INFO L225 Difference]: With dead ends: 38 [2018-11-23 13:02:46,333 INFO L226 Difference]: Without dead ends: 26 [2018-11-23 13:02:46,334 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=111, Invalid=591, Unknown=0, NotChecked=0, Total=702 [2018-11-23 13:02:46,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-11-23 13:02:46,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2018-11-23 13:02:46,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:02:46,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand 24 states. [2018-11-23 13:02:46,372 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 24 states. [2018-11-23 13:02:46,372 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 24 states. [2018-11-23 13:02:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,376 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:02:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:02:46,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:46,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:46,377 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 26 states. [2018-11-23 13:02:46,377 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 26 states. [2018-11-23 13:02:46,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:02:46,380 INFO L93 Difference]: Finished difference Result 26 states and 28 transitions. [2018-11-23 13:02:46,380 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-11-23 13:02:46,380 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:02:46,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:02:46,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:02:46,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:02:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 13:02:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2018-11-23 13:02:46,383 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 19 [2018-11-23 13:02:46,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:02:46,383 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2018-11-23 13:02:46,383 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 13:02:46,383 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2018-11-23 13:02:46,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:02:46,384 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:02:46,384 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:02:46,385 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:02:46,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:02:46,385 INFO L82 PathProgramCache]: Analyzing trace with hash 66146485, now seen corresponding path program 2 times [2018-11-23 13:02:46,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:02:46,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:02:46,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:46,386 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:02:46,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:02:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:46,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:02:46,439 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~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=4, n=6] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=4, n=-10] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(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:46,481 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2018-11-23 13:02:46,482 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2018-11-23 13:02:46,483 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2018-11-23 13:02:46,484 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2018-11-23 13:02:46,485 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:46,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:02:46 BoogieIcfgContainer [2018-11-23 13:02:46,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:02:46,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:02:46,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:02:46,487 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:02:46,488 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:40" (3/4) ... [2018-11-23 13:02:46,490 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~ret2 := main(); [?] havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=0] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] assume !(4 == ~i~0); VAL [main_~i~0=1, main_~n~0=4, main_~sn~0=2] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=2] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] assume !(4 == ~i~0); VAL [main_~i~0=2, main_~n~0=4, main_~sn~0=4] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=4] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] assume !(4 == ~i~0); VAL [main_~i~0=3, main_~n~0=4, main_~sn~0=6] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=6] [?] assume !!(~i~0 <= ~n~0);~sn~0 := 2 + ~sn~0; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=8] [?] assume 4 == ~i~0;~sn~0 := -10; VAL [main_~i~0=4, main_~n~0=4, main_~sn~0=(- 10)] [?] #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] assume !(~i~0 <= ~n~0); VAL [main_~i~0=5, main_~n~0=4, main_~sn~0=(- 10)] [?] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] assume !(4 == ~i~0); VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] assume !(4 == ~i~0); VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] assume !(4 == ~i~0); VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] assume !!(~i~0 <= ~n~0); [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] assume 4 == ~i~0; [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] assume !(~i~0 <= ~n~0); VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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~ret2 := main(); [L12] havoc ~i~0; [L12] ~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296); [L12] havoc #t~nondet0; [L12] ~sn~0 := 0; [L13] ~i~0 := 1; VAL [~i~0=1, ~n~0=4, ~sn~0=0] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=1, ~n~0=4, ~sn~0=2] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=2, ~n~0=4, ~sn~0=2] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=2, ~n~0=4, ~sn~0=4] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=3, ~n~0=4, ~sn~0=4] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L15] COND FALSE !(4 == ~i~0) VAL [~i~0=3, ~n~0=4, ~sn~0=6] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=4, ~n~0=4, ~sn~0=6] [L13-L16] COND FALSE !(!(~i~0 <= ~n~0)) [L14] ~sn~0 := 2 + ~sn~0; VAL [~i~0=4, ~n~0=4, ~sn~0=8] [L15] COND TRUE 4 == ~i~0 [L15] ~sn~0 := -10; VAL [~i~0=4, ~n~0=4, ~sn~0=-10] [L13] #t~post1 := ~i~0; [L13] ~i~0 := 1 + #t~post1; [L13] havoc #t~post1; VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L13-L16] COND TRUE !(~i~0 <= ~n~0) VAL [~i~0=5, ~n~0=4, ~sn~0=-10] [L17] CALL call __VERIFIER_assert((if ~sn~0 == 2 * ~n~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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=4, n=2] [L13] i++ VAL [i=2, n=4, n=2] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=6, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=-10, n=4] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(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:46,553 INFO L145 WitnessManager]: Wrote witness to /storage/repos/svcomp/c/loops/sum01_bug02_sum01_bug02_base.case_false-unreach-call_true-termination.i-witness.graphml [2018-11-23 13:02:46,553 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:02:46,555 INFO L168 Benchmark]: Toolchain (without parser) took 7614.79 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 1.7 GB in the end (delta: -299.7 MB). Peak memory consumption was 449.0 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:46,556 INFO L168 Benchmark]: CDTParser took 0.28 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:46,557 INFO L168 Benchmark]: CACSL2BoogieTranslator took 360.08 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:46,558 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.43 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:46,558 INFO L168 Benchmark]: Boogie Preprocessor took 31.45 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:46,559 INFO L168 Benchmark]: RCFGBuilder took 721.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:46,560 INFO L168 Benchmark]: TraceAbstraction took 6400.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.7 MB). Peak memory consumption was 478.7 MB. Max. memory is 7.1 GB. [2018-11-23 13:02:46,560 INFO L168 Benchmark]: Witness Printer took 66.53 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:02:46,564 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.28 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 360.08 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 29.43 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 31.45 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 721.47 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -789.0 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6400.66 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 1.7 GB in the end (delta: 478.7 MB). Peak memory consumption was 478.7 MB. Max. memory is 7.1 GB. * Witness Printer took 66.53 ms. Allocated memory is still 2.3 GB. Free memory is still 1.7 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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=1, n=4, n=2] [L15] COND FALSE !(i==4) VAL [i=1, n=2, n=4] [L13] i++ VAL [i=2, n=2, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=2, n=4, n=4] [L15] COND FALSE !(i==4) VAL [i=2, n=4, n=4] [L13] i++ VAL [i=3, n=4, n=4] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=3, n=4, n=6] [L15] COND FALSE !(i==4) VAL [i=3, n=6, n=4] [L13] i++ VAL [i=4, n=4, n=6] [L13] COND TRUE i<=n [L14] sn = sn + (2) VAL [i=4, n=8, n=4] [L15] COND TRUE i==4 [L15] sn=-10 VAL [i=4, n=-10, n=4] [L13] i++ VAL [i=5, n=4, n=-10] [L13] COND FALSE !(i<=n) VAL [i=5, n=-10, n=4] [L17] CALL __VERIFIER_assert(sn==n*(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, 6.3s OverallTime, 6 OverallIterations, 4 TraceHistogramMax, 2.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 59 SDtfs, 16 SDslu, 181 SDs, 0 SdLazy, 256 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 44 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 108 ConstructedInterpolants, 0 QuantifiedInterpolants, 7728 SizeOfPredicates, 7 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 41 ConjunctsInUnsatCore, 8 InterpolantComputations, 2 PerfectInterpolantSequences, 11/36 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...