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_Bitvector.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 11:23:38,823 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 11:23:38,825 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 11:23:38,841 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 11:23:38,841 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 11:23:38,842 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 11:23:38,844 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 11:23:38,846 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 11:23:38,847 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 11:23:38,848 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 11:23:38,849 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 11:23:38,849 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 11:23:38,850 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 11:23:38,852 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 11:23:38,853 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 11:23:38,854 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 11:23:38,854 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 11:23:38,856 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 11:23:38,859 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 11:23:38,860 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 11:23:38,862 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 11:23:38,865 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 11:23:38,871 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 11:23:38,871 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 11:23:38,871 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 11:23:38,876 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 11:23:38,877 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 11:23:38,878 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 11:23:38,879 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 11:23:38,880 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 11:23:38,880 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 11:23:38,886 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 11:23:38,886 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 11:23:38,886 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 11:23:38,888 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 11:23:38,888 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 11:23:38,889 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 11:23:38,907 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 11:23:38,907 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 11:23:38,908 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 11:23:38,908 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 11:23:38,909 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 11:23:38,909 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 11:23:38,909 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 11:23:38,909 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 11:23:38,910 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 11:23:38,910 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 11:23:38,910 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 11:23:38,910 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 11:23:38,910 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 11:23:38,911 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 11:23:38,911 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 11:23:38,911 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 11:23:38,911 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 11:23:38,911 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 11:23:38,912 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 11:23:38,912 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 11:23:38,912 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 11:23:38,912 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 11:23:38,912 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 11:23:38,913 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 11:23:38,913 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 11:23:38,913 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 11:23:38,913 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 11:23:38,914 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 11:23:38,958 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 11:23:38,974 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 11:23:38,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 11:23:38,981 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 11:23:38,982 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 11:23:38,983 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 11:23:39,047 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58500a8d6/e1cfc6ff06664ad8a09abe99b90264b2/FLAGd28f51f95 [2018-11-23 11:23:39,435 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 11:23:39,436 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 11:23:39,442 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58500a8d6/e1cfc6ff06664ad8a09abe99b90264b2/FLAGd28f51f95 [2018-11-23 11:23:39,825 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/58500a8d6/e1cfc6ff06664ad8a09abe99b90264b2 [2018-11-23 11:23:39,835 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 11:23:39,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 11:23:39,838 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:39,838 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 11:23:39,845 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 11:23:39,848 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:39" (1/1) ... [2018-11-23 11:23:39,851 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f245ad4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:39, skipping insertion in model container [2018-11-23 11:23:39,851 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 11:23:39" (1/1) ... [2018-11-23 11:23:39,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 11:23:39,887 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 11:23:40,141 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:40,147 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 11:23:40,167 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 11:23:40,186 INFO L195 MainTranslator]: Completed translation [2018-11-23 11:23:40,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40 WrapperNode [2018-11-23 11:23:40,187 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 11:23:40,188 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:40,188 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 11:23:40,189 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 11:23:40,199 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,211 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 11:23:40,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 11:23:40,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 11:23:40,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 11:23:40,230 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,232 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,232 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,247 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,248 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (1/1) ... [2018-11-23 11:23:40,250 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 11:23:40,251 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 11:23:40,251 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 11:23:40,251 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 11:23:40,252 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (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 11:23:40,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 11:23:40,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 11:23:40,376 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 11:23:40,376 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 11:23:40,377 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 11:23:40,377 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 11:23:40,377 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 11:23:40,377 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 11:23:40,823 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 11:23:40,823 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 11:23:40,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:40 BoogieIcfgContainer [2018-11-23 11:23:40,824 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 11:23:40,825 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 11:23:40,825 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 11:23:40,829 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 11:23:40,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 11:23:39" (1/3) ... [2018-11-23 11:23:40,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f42f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:40, skipping insertion in model container [2018-11-23 11:23:40,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 11:23:40" (2/3) ... [2018-11-23 11:23:40,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25f42f7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 11:23:40, skipping insertion in model container [2018-11-23 11:23:40,832 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 11:23:40" (3/3) ... [2018-11-23 11:23:40,833 INFO L112 eAbstractionObserver]: Analyzing ICFG sum01_bug02_false-unreach-call_true-termination.i [2018-11-23 11:23:40,844 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 11:23:40,854 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 11:23:40,873 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 11:23:40,909 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 11:23:40,910 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 11:23:40,910 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 11:23:40,910 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 11:23:40,910 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 11:23:40,910 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 11:23:40,911 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 11:23:40,911 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 11:23:40,911 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 11:23:40,930 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-23 11:23:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:23:40,937 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:40,938 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:40,941 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:40,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:40,948 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2018-11-23 11:23:40,953 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:40,953 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:40,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,022 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:41,086 INFO L256 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2018-11-23 11:23:41,090 INFO L273 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2018-11-23 11:23:41,090 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2018-11-23 11:23:41,091 INFO L256 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2018-11-23 11:23:41,091 INFO L273 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {23#true} is VALID [2018-11-23 11:23:41,095 INFO L273 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2018-11-23 11:23:41,095 INFO L256 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {24#false} is VALID [2018-11-23 11:23:41,096 INFO L273 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2018-11-23 11:23:41,096 INFO L273 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0bv32 == ~cond; {24#false} is VALID [2018-11-23 11:23:41,097 INFO L273 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2018-11-23 11:23:41,099 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 11:23:41,099 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:41,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:41,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 11:23:41,109 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:23:41,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:41,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 11:23:41,181 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 11:23:41,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 11:23:41,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 11:23:41,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:41,192 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2018-11-23 11:23:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:41,292 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2018-11-23 11:23:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 11:23:41,292 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-11-23 11:23:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:41,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:41,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:23:41,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 11:23:41,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2018-11-23 11:23:41,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2018-11-23 11:23:41,672 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:41,684 INFO L225 Difference]: With dead ends: 31 [2018-11-23 11:23:41,684 INFO L226 Difference]: Without dead ends: 14 [2018-11-23 11:23:41,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 11:23:41,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-11-23 11:23:41,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-23 11:23:41,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:41,736 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:41,737 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:41,737 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:41,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:41,740 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:23:41,741 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:41,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:41,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:41,741 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:41,742 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2018-11-23 11:23:41,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:41,745 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2018-11-23 11:23:41,745 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:41,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:41,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:41,746 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:41,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-23 11:23:41,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2018-11-23 11:23:41,750 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2018-11-23 11:23:41,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:41,751 INFO L480 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-23 11:23:41,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 11:23:41,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2018-11-23 11:23:41,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 11:23:41,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:41,752 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:41,752 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:41,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:41,753 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2018-11-23 11:23:41,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:41,753 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:41,775 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:41,807 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:41,981 INFO L256 TraceCheckUtils]: 0: Hoare triple {143#true} call ULTIMATE.init(); {143#true} is VALID [2018-11-23 11:23:41,982 INFO L273 TraceCheckUtils]: 1: Hoare triple {143#true} assume true; {143#true} is VALID [2018-11-23 11:23:41,982 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {143#true} {143#true} #39#return; {143#true} is VALID [2018-11-23 11:23:41,982 INFO L256 TraceCheckUtils]: 3: Hoare triple {143#true} call #t~ret3 := main(); {143#true} is VALID [2018-11-23 11:23:41,983 INFO L273 TraceCheckUtils]: 4: Hoare triple {143#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {160#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:23:41,984 INFO L273 TraceCheckUtils]: 5: Hoare triple {160#(= (_ bv0 32) main_~sn~0)} assume !~bvsle32(~i~0, ~n~0); {160#(= (_ bv0 32) main_~sn~0)} is VALID [2018-11-23 11:23:41,988 INFO L256 TraceCheckUtils]: 6: Hoare triple {160#(= (_ bv0 32) main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {167#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,990 INFO L273 TraceCheckUtils]: 7: Hoare triple {167#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {171#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:41,993 INFO L273 TraceCheckUtils]: 8: Hoare triple {171#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {144#false} is VALID [2018-11-23 11:23:41,993 INFO L273 TraceCheckUtils]: 9: Hoare triple {144#false} assume !false; {144#false} is VALID [2018-11-23 11:23:41,994 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 11:23:41,995 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:41,997 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:41,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 11:23:41,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:23:41,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:41,999 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 11:23:42,028 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 11:23:42,029 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 11:23:42,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 11:23:42,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 11:23:42,030 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2018-11-23 11:23:42,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:42,295 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:23:42,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 11:23:42,295 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-11-23 11:23:42,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:42,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:23:42,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 11:23:42,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 11:23:42,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2018-11-23 11:23:42,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2018-11-23 11:23:42,359 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:42,362 INFO L225 Difference]: With dead ends: 23 [2018-11-23 11:23:42,362 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 11:23:42,363 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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 11:23:42,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 11:23:42,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 11:23:42,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:42,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 11:23:42,380 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:23:42,381 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:23:42,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:42,383 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:23:42,383 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:23:42,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:42,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:42,384 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 11:23:42,384 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 11:23:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:42,386 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2018-11-23 11:23:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:23:42,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:42,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:42,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:42,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:42,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 11:23:42,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2018-11-23 11:23:42,390 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2018-11-23 11:23:42,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:42,390 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2018-11-23 11:23:42,390 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 11:23:42,390 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2018-11-23 11:23:42,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 11:23:42,391 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:42,391 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:42,391 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:42,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:42,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2018-11-23 11:23:42,392 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:42,393 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:42,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:42,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:42,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:42,456 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:43,229 INFO L256 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2018-11-23 11:23:43,230 INFO L273 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2018-11-23 11:23:43,230 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #39#return; {274#true} is VALID [2018-11-23 11:23:43,230 INFO L256 TraceCheckUtils]: 3: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID [2018-11-23 11:23:43,232 INFO L273 TraceCheckUtils]: 4: Hoare triple {274#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {291#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:43,233 INFO L273 TraceCheckUtils]: 5: Hoare triple {291#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {295#(and (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:43,233 INFO L273 TraceCheckUtils]: 6: Hoare triple {295#(and (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {299#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:43,234 INFO L273 TraceCheckUtils]: 7: Hoare triple {299#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {299#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:43,246 INFO L273 TraceCheckUtils]: 8: Hoare triple {299#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {306#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:43,262 INFO L273 TraceCheckUtils]: 9: Hoare triple {306#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {310#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~sn~0))} is VALID [2018-11-23 11:23:43,277 INFO L256 TraceCheckUtils]: 10: Hoare triple {310#(and (not (bvsle (_ bv2 32) main_~n~0)) (bvsle (_ bv1 32) main_~n~0) (= (_ bv2 32) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {314#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:43,278 INFO L273 TraceCheckUtils]: 11: Hoare triple {314#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {318#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:43,282 INFO L273 TraceCheckUtils]: 12: Hoare triple {318#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {275#false} is VALID [2018-11-23 11:23:43,282 INFO L273 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID [2018-11-23 11:23:43,284 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 11:23:43,284 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:44,445 INFO L273 TraceCheckUtils]: 13: Hoare triple {275#false} assume !false; {275#false} is VALID [2018-11-23 11:23:44,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {328#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {275#false} is VALID [2018-11-23 11:23:44,458 INFO L273 TraceCheckUtils]: 11: Hoare triple {332#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {328#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:44,462 INFO L256 TraceCheckUtils]: 10: Hoare triple {336#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {332#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:44,463 INFO L273 TraceCheckUtils]: 9: Hoare triple {340#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !~bvsle32(~i~0, ~n~0); {336#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:44,467 INFO L273 TraceCheckUtils]: 8: Hoare triple {344#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {340#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:44,467 INFO L273 TraceCheckUtils]: 7: Hoare triple {344#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {344#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:44,482 INFO L273 TraceCheckUtils]: 6: Hoare triple {351#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {344#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:44,485 INFO L273 TraceCheckUtils]: 5: Hoare triple {355#(or (= (_ bv4294967294 32) main_~sn~0) (forall ((main_~n~0 (_ BitVec 32))) (or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))))} assume !!~bvsle32(~i~0, ~n~0); {351#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:44,488 INFO L273 TraceCheckUtils]: 4: Hoare triple {274#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {355#(or (= (_ bv4294967294 32) main_~sn~0) (forall ((main_~n~0 (_ BitVec 32))) (or (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))))} is VALID [2018-11-23 11:23:44,488 INFO L256 TraceCheckUtils]: 3: Hoare triple {274#true} call #t~ret3 := main(); {274#true} is VALID [2018-11-23 11:23:44,489 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {274#true} {274#true} #39#return; {274#true} is VALID [2018-11-23 11:23:44,489 INFO L273 TraceCheckUtils]: 1: Hoare triple {274#true} assume true; {274#true} is VALID [2018-11-23 11:23:44,489 INFO L256 TraceCheckUtils]: 0: Hoare triple {274#true} call ULTIMATE.init(); {274#true} is VALID [2018-11-23 11:23:44,491 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 11:23:44,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:44,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2018-11-23 11:23:44,493 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:23:44,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:44,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2018-11-23 11:23:44,559 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:44,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 11:23:44,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 11:23:44,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-23 11:23:44,560 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2018-11-23 11:23:45,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:45,924 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2018-11-23 11:23:45,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 11:23:45,925 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2018-11-23 11:23:45,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:45,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:23:45,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2018-11-23 11:23:45,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 11:23:45,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2018-11-23 11:23:45,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2018-11-23 11:23:46,025 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 11:23:46,028 INFO L225 Difference]: With dead ends: 39 [2018-11-23 11:23:46,029 INFO L226 Difference]: Without dead ends: 33 [2018-11-23 11:23:46,029 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2018-11-23 11:23:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-23 11:23:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2018-11-23 11:23:46,058 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:46,058 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 27 states. [2018-11-23 11:23:46,058 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 27 states. [2018-11-23 11:23:46,058 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 27 states. [2018-11-23 11:23:46,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:46,061 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 11:23:46,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 11:23:46,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:46,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:46,062 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 33 states. [2018-11-23 11:23:46,063 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 33 states. [2018-11-23 11:23:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:46,065 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-11-23 11:23:46,066 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-23 11:23:46,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:46,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:46,067 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:46,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 11:23:46,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-23 11:23:46,069 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2018-11-23 11:23:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:46,069 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-23 11:23:46,070 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 11:23:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2018-11-23 11:23:46,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:23:46,071 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:46,071 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:46,071 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:46,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:46,072 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2018-11-23 11:23:46,072 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:46,072 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:46,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 11:23:46,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:46,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:46,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:46,207 INFO L256 TraceCheckUtils]: 0: Hoare triple {538#true} call ULTIMATE.init(); {538#true} is VALID [2018-11-23 11:23:46,207 INFO L273 TraceCheckUtils]: 1: Hoare triple {538#true} assume true; {538#true} is VALID [2018-11-23 11:23:46,208 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {538#true} {538#true} #39#return; {538#true} is VALID [2018-11-23 11:23:46,208 INFO L256 TraceCheckUtils]: 3: Hoare triple {538#true} call #t~ret3 := main(); {538#true} is VALID [2018-11-23 11:23:46,211 INFO L273 TraceCheckUtils]: 4: Hoare triple {538#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {555#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,212 INFO L273 TraceCheckUtils]: 5: Hoare triple {555#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {555#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,213 INFO L273 TraceCheckUtils]: 6: Hoare triple {555#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !~bvslt32(~i~0, ~j~0); {539#false} is VALID [2018-11-23 11:23:46,213 INFO L273 TraceCheckUtils]: 7: Hoare triple {539#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {539#false} is VALID [2018-11-23 11:23:46,214 INFO L273 TraceCheckUtils]: 8: Hoare triple {539#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {539#false} is VALID [2018-11-23 11:23:46,214 INFO L273 TraceCheckUtils]: 9: Hoare triple {539#false} assume !!~bvsle32(~i~0, ~n~0); {539#false} is VALID [2018-11-23 11:23:46,214 INFO L273 TraceCheckUtils]: 10: Hoare triple {539#false} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {539#false} is VALID [2018-11-23 11:23:46,215 INFO L273 TraceCheckUtils]: 11: Hoare triple {539#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {539#false} is VALID [2018-11-23 11:23:46,215 INFO L273 TraceCheckUtils]: 12: Hoare triple {539#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {539#false} is VALID [2018-11-23 11:23:46,215 INFO L273 TraceCheckUtils]: 13: Hoare triple {539#false} assume !~bvsle32(~i~0, ~n~0); {539#false} is VALID [2018-11-23 11:23:46,215 INFO L256 TraceCheckUtils]: 14: Hoare triple {539#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {539#false} is VALID [2018-11-23 11:23:46,216 INFO L273 TraceCheckUtils]: 15: Hoare triple {539#false} ~cond := #in~cond; {539#false} is VALID [2018-11-23 11:23:46,216 INFO L273 TraceCheckUtils]: 16: Hoare triple {539#false} assume 0bv32 == ~cond; {539#false} is VALID [2018-11-23 11:23:46,217 INFO L273 TraceCheckUtils]: 17: Hoare triple {539#false} assume !false; {539#false} is VALID [2018-11-23 11:23:46,218 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-23 11:23:46,218 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 11:23:46,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 11:23:46,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-23 11:23:46,223 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:23:46,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:46,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2018-11-23 11:23:46,251 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 11:23:46,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 11:23:46,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 11:23:46,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:23:46,252 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2018-11-23 11:23:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:46,331 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2018-11-23 11:23:46,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 11:23:46,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-11-23 11:23:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:23:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-11-23 11:23:46,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 11:23:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2018-11-23 11:23:46,337 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2018-11-23 11:23:46,437 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:46,438 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:23:46,438 INFO L226 Difference]: Without dead ends: 23 [2018-11-23 11:23:46,439 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 11:23:46,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-11-23 11:23:46,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-11-23 11:23:46,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:46,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2018-11-23 11:23:46,459 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:23:46,460 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:23:46,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:46,462 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:23:46,462 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:46,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:46,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:46,463 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2018-11-23 11:23:46,463 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2018-11-23 11:23:46,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:46,465 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-11-23 11:23:46,466 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:46,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:46,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:46,466 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:46,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:46,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 11:23:46,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 11:23:46,469 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2018-11-23 11:23:46,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:46,469 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 11:23:46,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 11:23:46,469 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 11:23:46,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 11:23:46,470 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:46,470 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:46,471 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:46,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:46,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2018-11-23 11:23:46,471 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:46,472 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:46,490 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:46,518 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:46,518 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:46,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:46,530 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:46,617 INFO L256 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2018-11-23 11:23:46,617 INFO L273 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-23 11:23:46,617 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #39#return; {723#true} is VALID [2018-11-23 11:23:46,618 INFO L256 TraceCheckUtils]: 3: Hoare triple {723#true} call #t~ret3 := main(); {723#true} is VALID [2018-11-23 11:23:46,618 INFO L273 TraceCheckUtils]: 4: Hoare triple {723#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,619 INFO L273 TraceCheckUtils]: 5: Hoare triple {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,620 INFO L273 TraceCheckUtils]: 6: Hoare triple {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,620 INFO L273 TraceCheckUtils]: 7: Hoare triple {740#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {750#(and (= (_ bv9 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:46,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {750#(and (= (_ bv9 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {754#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:46,626 INFO L273 TraceCheckUtils]: 9: Hoare triple {754#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0); {754#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:46,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {754#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} assume !~bvslt32(~i~0, ~j~0); {724#false} is VALID [2018-11-23 11:23:46,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {724#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {724#false} is VALID [2018-11-23 11:23:46,627 INFO L273 TraceCheckUtils]: 12: Hoare triple {724#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {724#false} is VALID [2018-11-23 11:23:46,627 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#false} assume !~bvsle32(~i~0, ~n~0); {724#false} is VALID [2018-11-23 11:23:46,627 INFO L256 TraceCheckUtils]: 14: Hoare triple {724#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {724#false} is VALID [2018-11-23 11:23:46,628 INFO L273 TraceCheckUtils]: 15: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2018-11-23 11:23:46,628 INFO L273 TraceCheckUtils]: 16: Hoare triple {724#false} assume 0bv32 == ~cond; {724#false} is VALID [2018-11-23 11:23:46,628 INFO L273 TraceCheckUtils]: 17: Hoare triple {724#false} assume !false; {724#false} is VALID [2018-11-23 11:23:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:46,630 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:46,765 INFO L273 TraceCheckUtils]: 17: Hoare triple {724#false} assume !false; {724#false} is VALID [2018-11-23 11:23:46,766 INFO L273 TraceCheckUtils]: 16: Hoare triple {724#false} assume 0bv32 == ~cond; {724#false} is VALID [2018-11-23 11:23:46,766 INFO L273 TraceCheckUtils]: 15: Hoare triple {724#false} ~cond := #in~cond; {724#false} is VALID [2018-11-23 11:23:46,767 INFO L256 TraceCheckUtils]: 14: Hoare triple {724#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {724#false} is VALID [2018-11-23 11:23:46,767 INFO L273 TraceCheckUtils]: 13: Hoare triple {724#false} assume !~bvsle32(~i~0, ~n~0); {724#false} is VALID [2018-11-23 11:23:46,768 INFO L273 TraceCheckUtils]: 12: Hoare triple {724#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {724#false} is VALID [2018-11-23 11:23:46,768 INFO L273 TraceCheckUtils]: 11: Hoare triple {724#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {724#false} is VALID [2018-11-23 11:23:46,774 INFO L273 TraceCheckUtils]: 10: Hoare triple {803#(bvslt main_~i~0 main_~j~0)} assume !~bvslt32(~i~0, ~j~0); {724#false} is VALID [2018-11-23 11:23:46,775 INFO L273 TraceCheckUtils]: 9: Hoare triple {803#(bvslt main_~i~0 main_~j~0)} assume !!~bvsle32(~i~0, ~n~0); {803#(bvslt main_~i~0 main_~j~0)} is VALID [2018-11-23 11:23:46,776 INFO L273 TraceCheckUtils]: 8: Hoare triple {810#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {803#(bvslt main_~i~0 main_~j~0)} is VALID [2018-11-23 11:23:46,776 INFO L273 TraceCheckUtils]: 7: Hoare triple {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {810#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)} is VALID [2018-11-23 11:23:46,778 INFO L273 TraceCheckUtils]: 6: Hoare triple {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:23:46,779 INFO L273 TraceCheckUtils]: 5: Hoare triple {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} assume !!~bvsle32(~i~0, ~n~0); {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:23:46,780 INFO L273 TraceCheckUtils]: 4: Hoare triple {723#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {814#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:23:46,780 INFO L256 TraceCheckUtils]: 3: Hoare triple {723#true} call #t~ret3 := main(); {723#true} is VALID [2018-11-23 11:23:46,780 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {723#true} {723#true} #39#return; {723#true} is VALID [2018-11-23 11:23:46,781 INFO L273 TraceCheckUtils]: 1: Hoare triple {723#true} assume true; {723#true} is VALID [2018-11-23 11:23:46,781 INFO L256 TraceCheckUtils]: 0: Hoare triple {723#true} call ULTIMATE.init(); {723#true} is VALID [2018-11-23 11:23:46,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:46,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:46,785 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2018-11-23 11:23:46,785 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:23:46,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:46,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 11:23:46,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:46,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 11:23:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 11:23:46,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-11-23 11:23:46,824 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2018-11-23 11:23:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,460 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-23 11:23:47,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 11:23:47,461 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-23 11:23:47,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:47,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:47,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-23 11:23:47,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 11:23:47,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2018-11-23 11:23:47,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2018-11-23 11:23:47,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:47,636 INFO L225 Difference]: With dead ends: 36 [2018-11-23 11:23:47,636 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 11:23:47,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2018-11-23 11:23:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 11:23:47,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2018-11-23 11:23:47,663 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:47,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 24 states. [2018-11-23 11:23:47,664 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 24 states. [2018-11-23 11:23:47,664 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 24 states. [2018-11-23 11:23:47,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,666 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 11:23:47,667 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:23:47,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,667 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 27 states. [2018-11-23 11:23:47,668 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 27 states. [2018-11-23 11:23:47,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:47,670 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 11:23:47,670 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 11:23:47,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:47,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:47,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:47,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:47,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 11:23:47,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-11-23 11:23:47,673 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-11-23 11:23:47,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:47,673 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-11-23 11:23:47,673 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 11:23:47,673 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-11-23 11:23:47,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 11:23:47,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:47,675 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:47,675 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:47,675 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:47,675 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2018-11-23 11:23:47,676 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:47,676 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:47,704 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 11:23:47,745 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-23 11:23:47,745 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:47,766 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:48,320 INFO L256 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2018-11-23 11:23:48,320 INFO L273 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2018-11-23 11:23:48,321 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #39#return; {979#true} is VALID [2018-11-23 11:23:48,321 INFO L256 TraceCheckUtils]: 3: Hoare triple {979#true} call #t~ret3 := main(); {979#true} is VALID [2018-11-23 11:23:48,329 INFO L273 TraceCheckUtils]: 4: Hoare triple {979#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {996#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,331 INFO L273 TraceCheckUtils]: 5: Hoare triple {996#(and (= (_ bv0 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {1000#(and (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,331 INFO L273 TraceCheckUtils]: 6: Hoare triple {1000#(and (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1004#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {1004#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1004#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,336 INFO L273 TraceCheckUtils]: 8: Hoare triple {1004#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1011#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:48,337 INFO L273 TraceCheckUtils]: 9: Hoare triple {1011#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0); {1015#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:48,339 INFO L273 TraceCheckUtils]: 10: Hoare triple {1015#(and (bvsle main_~i~0 main_~n~0) (= (_ bv2 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1019#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:48,340 INFO L273 TraceCheckUtils]: 11: Hoare triple {1019#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1019#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:48,342 INFO L273 TraceCheckUtils]: 12: Hoare triple {1019#(and (bvsle main_~i~0 main_~n~0) (= (_ bv4 32) main_~sn~0) (= (_ bv2 32) main_~i~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1026#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-23 11:23:48,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {1026#(and (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume !!~bvsle32(~i~0, ~n~0); {1030#(and (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} is VALID [2018-11-23 11:23:48,345 INFO L273 TraceCheckUtils]: 14: Hoare triple {1030#(and (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv4 32) main_~sn~0))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1034#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,345 INFO L273 TraceCheckUtils]: 15: Hoare triple {1034#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1034#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:48,347 INFO L273 TraceCheckUtils]: 16: Hoare triple {1034#(and (= (_ bv6 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1041#(and (= (_ bv6 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0))} is VALID [2018-11-23 11:23:48,348 INFO L273 TraceCheckUtils]: 17: Hoare triple {1041#(and (= (_ bv6 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv4294967295 32)) main_~n~0) (= (_ bv4 32) main_~i~0))} assume !~bvsle32(~i~0, ~n~0); {1045#(and (= (_ bv6 32) main_~sn~0) (bvsle (_ bv3 32) main_~n~0) (not (bvsle (_ bv4 32) main_~n~0)))} is VALID [2018-11-23 11:23:48,351 INFO L256 TraceCheckUtils]: 18: Hoare triple {1045#(and (= (_ bv6 32) main_~sn~0) (bvsle (_ bv3 32) main_~n~0) (not (bvsle (_ bv4 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1049#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:48,366 INFO L273 TraceCheckUtils]: 19: Hoare triple {1049#(= (bvadd |__VERIFIER_assert_#in~cond| (_ bv4294967295 32)) (_ bv0 32))} ~cond := #in~cond; {1053#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} is VALID [2018-11-23 11:23:48,367 INFO L273 TraceCheckUtils]: 20: Hoare triple {1053#(= (bvadd __VERIFIER_assert_~cond (_ bv4294967295 32)) (_ bv0 32))} assume 0bv32 == ~cond; {980#false} is VALID [2018-11-23 11:23:48,367 INFO L273 TraceCheckUtils]: 21: Hoare triple {980#false} assume !false; {980#false} is VALID [2018-11-23 11:23:48,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:48,370 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:50,162 INFO L273 TraceCheckUtils]: 21: Hoare triple {980#false} assume !false; {980#false} is VALID [2018-11-23 11:23:50,163 INFO L273 TraceCheckUtils]: 20: Hoare triple {1063#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} assume 0bv32 == ~cond; {980#false} is VALID [2018-11-23 11:23:50,164 INFO L273 TraceCheckUtils]: 19: Hoare triple {1067#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {1063#(not (= (_ bv0 32) __VERIFIER_assert_~cond))} is VALID [2018-11-23 11:23:50,166 INFO L256 TraceCheckUtils]: 18: Hoare triple {1071#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1067#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2018-11-23 11:23:50,170 INFO L273 TraceCheckUtils]: 17: Hoare triple {1075#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} assume !~bvsle32(~i~0, ~n~0); {1071#(or (= (_ bv0 32) main_~sn~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,171 INFO L273 TraceCheckUtils]: 16: Hoare triple {1079#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1075#(or (= (_ bv0 32) main_~sn~0) (bvsle main_~i~0 main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,171 INFO L273 TraceCheckUtils]: 15: Hoare triple {1079#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1079#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,193 INFO L273 TraceCheckUtils]: 14: Hoare triple {1086#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1079#(or (= (_ bv0 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= main_~sn~0 (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,194 INFO L273 TraceCheckUtils]: 13: Hoare triple {1090#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0); {1086#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,229 INFO L273 TraceCheckUtils]: 12: Hoare triple {1094#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1090#(or (= (_ bv4294967294 32) main_~sn~0) (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,230 INFO L273 TraceCheckUtils]: 11: Hoare triple {1094#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1094#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,257 INFO L273 TraceCheckUtils]: 10: Hoare triple {1101#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1094#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (_ bv4294967294 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv2 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,259 INFO L273 TraceCheckUtils]: 9: Hoare triple {1105#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} assume !!~bvsle32(~i~0, ~n~0); {1101#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,331 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1105#(or (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,332 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1109#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,374 INFO L273 TraceCheckUtils]: 6: Hoare triple {1116#(or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (_ bv4294967290 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1109#(or (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (bvadd main_~sn~0 (_ bv4 32)) (_ bv0 32)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)) (= (bvadd main_~sn~0 (_ bv4 32)) (bvmul (_ bv2 32) main_~n~0)))} is VALID [2018-11-23 11:23:50,378 INFO L273 TraceCheckUtils]: 5: Hoare triple {1120#(or (forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))) (= (_ bv4294967290 32) main_~sn~0))} assume !!~bvsle32(~i~0, ~n~0); {1116#(or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (= (_ bv4294967290 32) main_~sn~0) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))} is VALID [2018-11-23 11:23:50,382 INFO L273 TraceCheckUtils]: 4: Hoare triple {979#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {1120#(or (forall ((main_~n~0 (_ BitVec 32))) (or (= (bvadd main_~sn~0 (_ bv6 32)) (bvmul (_ bv2 32) main_~n~0)) (bvsle (bvadd main_~i~0 (_ bv3 32)) main_~n~0) (not (bvsle main_~i~0 main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv1 32)) main_~n~0)) (not (bvsle (bvadd main_~i~0 (_ bv2 32)) main_~n~0)))) (= (_ bv4294967290 32) main_~sn~0))} is VALID [2018-11-23 11:23:50,383 INFO L256 TraceCheckUtils]: 3: Hoare triple {979#true} call #t~ret3 := main(); {979#true} is VALID [2018-11-23 11:23:50,383 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {979#true} {979#true} #39#return; {979#true} is VALID [2018-11-23 11:23:50,383 INFO L273 TraceCheckUtils]: 1: Hoare triple {979#true} assume true; {979#true} is VALID [2018-11-23 11:23:50,384 INFO L256 TraceCheckUtils]: 0: Hoare triple {979#true} call ULTIMATE.init(); {979#true} is VALID [2018-11-23 11:23:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:50,390 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:50,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2018-11-23 11:23:50,391 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:23:50,391 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:50,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states. [2018-11-23 11:23:50,662 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:50,662 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-11-23 11:23:50,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-11-23 11:23:50,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=630, Unknown=0, NotChecked=0, Total=756 [2018-11-23 11:23:50,664 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 28 states. [2018-11-23 11:23:53,008 WARN L180 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2018-11-23 11:23:53,757 WARN L180 SmtUtils]: Spent 170.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-11-23 11:23:55,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:55,745 INFO L93 Difference]: Finished difference Result 53 states and 60 transitions. [2018-11-23 11:23:55,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-11-23 11:23:55,745 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 22 [2018-11-23 11:23:55,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:23:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:23:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2018-11-23 11:23:55,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-23 11:23:55,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 60 transitions. [2018-11-23 11:23:55,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 60 transitions. [2018-11-23 11:23:56,296 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:56,298 INFO L225 Difference]: With dead ends: 53 [2018-11-23 11:23:56,298 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 11:23:56,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=271, Invalid=1289, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 11:23:56,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 11:23:56,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2018-11-23 11:23:56,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:23:56,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 39 states. [2018-11-23 11:23:56,329 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 39 states. [2018-11-23 11:23:56,329 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 39 states. [2018-11-23 11:23:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:56,332 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 11:23:56,332 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 11:23:56,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:56,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:56,333 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 47 states. [2018-11-23 11:23:56,333 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 47 states. [2018-11-23 11:23:56,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:23:56,335 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2018-11-23 11:23:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2018-11-23 11:23:56,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:23:56,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:23:56,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:23:56,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:23:56,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 11:23:56,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2018-11-23 11:23:56,338 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 22 [2018-11-23 11:23:56,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:23:56,339 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2018-11-23 11:23:56,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-11-23 11:23:56,339 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2018-11-23 11:23:56,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 11:23:56,340 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:23:56,340 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:23:56,340 INFO L423 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:23:56,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:23:56,341 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 3 times [2018-11-23 11:23:56,341 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:23:56,341 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:23:56,376 INFO L101 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2018-11-23 11:23:56,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2018-11-23 11:23:56,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 11:23:56,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 11:23:56,484 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 11:23:56,671 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-23 11:23:56,672 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-23 11:23:56,672 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #39#return; {1379#true} is VALID [2018-11-23 11:23:56,672 INFO L256 TraceCheckUtils]: 3: Hoare triple {1379#true} call #t~ret3 := main(); {1379#true} is VALID [2018-11-23 11:23:56,673 INFO L273 TraceCheckUtils]: 4: Hoare triple {1379#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,673 INFO L273 TraceCheckUtils]: 5: Hoare triple {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,674 INFO L273 TraceCheckUtils]: 6: Hoare triple {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,675 INFO L273 TraceCheckUtils]: 7: Hoare triple {1396#(and (= (bvadd main_~j~0 (_ bv4294967286 32)) (_ bv0 32)) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1406#(and (= (_ bv9 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,692 INFO L273 TraceCheckUtils]: 8: Hoare triple {1406#(and (= (_ bv9 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967295 32)) (_ bv0 32)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:56,707 INFO L273 TraceCheckUtils]: 9: Hoare triple {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} assume !!~bvsle32(~i~0, ~n~0); {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:56,715 INFO L273 TraceCheckUtils]: 10: Hoare triple {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:56,716 INFO L273 TraceCheckUtils]: 11: Hoare triple {1410#(and (= (_ bv9 32) main_~j~0) (= (_ bv2 32) main_~i~0))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1420#(and (= (_ bv8 32) main_~j~0) (= (_ bv2 32) main_~i~0))} is VALID [2018-11-23 11:23:56,717 INFO L273 TraceCheckUtils]: 12: Hoare triple {1420#(and (= (_ bv8 32) main_~j~0) (= (_ bv2 32) main_~i~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,718 INFO L273 TraceCheckUtils]: 13: Hoare triple {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume !!~bvsle32(~i~0, ~n~0); {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,718 INFO L273 TraceCheckUtils]: 14: Hoare triple {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} is VALID [2018-11-23 11:23:56,719 INFO L273 TraceCheckUtils]: 15: Hoare triple {1424#(and (= (_ bv8 32) main_~j~0) (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1434#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 11:23:56,719 INFO L273 TraceCheckUtils]: 16: Hoare triple {1434#(and (= (bvadd main_~i~0 (_ bv4294967293 32)) (_ bv0 32)) (= (_ bv7 32) main_~j~0))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1438#(and (= (_ bv4 32) main_~i~0) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 11:23:56,720 INFO L273 TraceCheckUtils]: 17: Hoare triple {1438#(and (= (_ bv4 32) main_~i~0) (= (_ bv7 32) main_~j~0))} assume !!~bvsle32(~i~0, ~n~0); {1438#(and (= (_ bv4 32) main_~i~0) (= (_ bv7 32) main_~j~0))} is VALID [2018-11-23 11:23:56,721 INFO L273 TraceCheckUtils]: 18: Hoare triple {1438#(and (= (_ bv4 32) main_~i~0) (= (_ bv7 32) main_~j~0))} assume !~bvslt32(~i~0, ~j~0); {1380#false} is VALID [2018-11-23 11:23:56,722 INFO L273 TraceCheckUtils]: 19: Hoare triple {1380#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1380#false} is VALID [2018-11-23 11:23:56,722 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1380#false} is VALID [2018-11-23 11:23:56,722 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume !~bvsle32(~i~0, ~n~0); {1380#false} is VALID [2018-11-23 11:23:56,723 INFO L256 TraceCheckUtils]: 22: Hoare triple {1380#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1380#false} is VALID [2018-11-23 11:23:56,723 INFO L273 TraceCheckUtils]: 23: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-23 11:23:56,723 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} assume 0bv32 == ~cond; {1380#false} is VALID [2018-11-23 11:23:56,723 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-23 11:23:56,726 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:56,726 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 11:23:57,382 INFO L273 TraceCheckUtils]: 25: Hoare triple {1380#false} assume !false; {1380#false} is VALID [2018-11-23 11:23:57,383 INFO L273 TraceCheckUtils]: 24: Hoare triple {1380#false} assume 0bv32 == ~cond; {1380#false} is VALID [2018-11-23 11:23:57,383 INFO L273 TraceCheckUtils]: 23: Hoare triple {1380#false} ~cond := #in~cond; {1380#false} is VALID [2018-11-23 11:23:57,383 INFO L256 TraceCheckUtils]: 22: Hoare triple {1380#false} call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); {1380#false} is VALID [2018-11-23 11:23:57,384 INFO L273 TraceCheckUtils]: 21: Hoare triple {1380#false} assume !~bvsle32(~i~0, ~n~0); {1380#false} is VALID [2018-11-23 11:23:57,384 INFO L273 TraceCheckUtils]: 20: Hoare triple {1380#false} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1380#false} is VALID [2018-11-23 11:23:57,384 INFO L273 TraceCheckUtils]: 19: Hoare triple {1380#false} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1380#false} is VALID [2018-11-23 11:23:57,385 INFO L273 TraceCheckUtils]: 18: Hoare triple {1487#(bvslt main_~i~0 main_~j~0)} assume !~bvslt32(~i~0, ~j~0); {1380#false} is VALID [2018-11-23 11:23:57,385 INFO L273 TraceCheckUtils]: 17: Hoare triple {1487#(bvslt main_~i~0 main_~j~0)} assume !!~bvsle32(~i~0, ~n~0); {1487#(bvslt main_~i~0 main_~j~0)} is VALID [2018-11-23 11:23:57,386 INFO L273 TraceCheckUtils]: 16: Hoare triple {1494#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1487#(bvslt main_~i~0 main_~j~0)} is VALID [2018-11-23 11:23:57,386 INFO L273 TraceCheckUtils]: 15: Hoare triple {1498#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1494#(bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)} is VALID [2018-11-23 11:23:57,387 INFO L273 TraceCheckUtils]: 14: Hoare triple {1502#(or (not (bvslt main_~i~0 main_~j~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32))))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1498#(bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))} is VALID [2018-11-23 11:23:57,388 INFO L273 TraceCheckUtils]: 13: Hoare triple {1502#(or (not (bvslt main_~i~0 main_~j~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32))))} assume !!~bvsle32(~i~0, ~n~0); {1502#(or (not (bvslt main_~i~0 main_~j~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:23:57,477 INFO L273 TraceCheckUtils]: 12: Hoare triple {1509#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967295 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1502#(or (not (bvslt main_~i~0 main_~j~0)) (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32))))} is VALID [2018-11-23 11:23:57,506 INFO L273 TraceCheckUtils]: 11: Hoare triple {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1509#(or (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967295 32))) (not (bvslt (bvadd main_~i~0 (_ bv1 32)) main_~j~0)))} is VALID [2018-11-23 11:23:57,508 INFO L273 TraceCheckUtils]: 10: Hoare triple {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} is VALID [2018-11-23 11:23:57,508 INFO L273 TraceCheckUtils]: 9: Hoare triple {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} assume !!~bvsle32(~i~0, ~n~0); {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} is VALID [2018-11-23 11:23:57,703 INFO L273 TraceCheckUtils]: 8: Hoare triple {1523#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967294 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967295 32)))))} #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; {1513#(or (not (bvslt (bvadd main_~i~0 (_ bv1 32)) (bvadd main_~j~0 (_ bv4294967295 32)))) (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32))))} is VALID [2018-11-23 11:23:57,956 INFO L273 TraceCheckUtils]: 7: Hoare triple {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; {1523#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967294 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967295 32)))))} is VALID [2018-11-23 11:23:57,956 INFO L273 TraceCheckUtils]: 6: Hoare triple {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} is VALID [2018-11-23 11:23:57,958 INFO L273 TraceCheckUtils]: 5: Hoare triple {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} assume !!~bvsle32(~i~0, ~n~0); {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} is VALID [2018-11-23 11:23:57,959 INFO L273 TraceCheckUtils]: 4: Hoare triple {1379#true} havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; {1527#(or (bvslt (bvadd main_~i~0 (_ bv3 32)) (bvadd main_~j~0 (_ bv4294967293 32))) (not (bvslt (bvadd main_~i~0 (_ bv2 32)) (bvadd main_~j~0 (_ bv4294967294 32)))))} is VALID [2018-11-23 11:23:57,959 INFO L256 TraceCheckUtils]: 3: Hoare triple {1379#true} call #t~ret3 := main(); {1379#true} is VALID [2018-11-23 11:23:57,960 INFO L268 TraceCheckUtils]: 2: Hoare quadruple {1379#true} {1379#true} #39#return; {1379#true} is VALID [2018-11-23 11:23:57,960 INFO L273 TraceCheckUtils]: 1: Hoare triple {1379#true} assume true; {1379#true} is VALID [2018-11-23 11:23:57,960 INFO L256 TraceCheckUtils]: 0: Hoare triple {1379#true} call ULTIMATE.init(); {1379#true} is VALID [2018-11-23 11:23:57,962 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 11:23:57,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 11:23:57,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 17 [2018-11-23 11:23:57,973 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 11:23:57,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 11:23:57,973 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states. [2018-11-23 11:23:58,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:23:58,518 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 11:23:58,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 11:23:58,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2018-11-23 11:23:58,518 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 17 states. [2018-11-23 11:23:59,771 WARN L180 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 24 [2018-11-23 11:24:01,219 WARN L180 SmtUtils]: Spent 346.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2018-11-23 11:24:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:03,266 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 11:24:03,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 11:24:03,266 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-11-23 11:24:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 11:24:03,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:24:03,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2018-11-23 11:24:03,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 11:24:03,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 56 transitions. [2018-11-23 11:24:03,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 56 transitions. [2018-11-23 11:24:04,604 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 11:24:04,605 INFO L225 Difference]: With dead ends: 50 [2018-11-23 11:24:04,606 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 11:24:04,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=137, Invalid=325, Unknown=0, NotChecked=0, Total=462 [2018-11-23 11:24:04,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 11:24:04,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 11:24:04,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 11:24:04,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 11:24:04,742 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 11:24:04,742 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 11:24:04,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:04,745 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 11:24:04,745 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 11:24:04,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:04,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:04,746 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 11:24:04,746 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 11:24:04,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 11:24:04,748 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-11-23 11:24:04,748 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2018-11-23 11:24:04,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 11:24:04,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 11:24:04,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 11:24:04,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 11:24:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 11:24:04,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2018-11-23 11:24:04,751 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 26 [2018-11-23 11:24:04,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 11:24:04,751 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2018-11-23 11:24:04,751 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 11:24:04,751 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2018-11-23 11:24:04,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 11:24:04,752 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 11:24:04,752 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 11:24:04,753 INFO L423 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 11:24:04,753 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 11:24:04,753 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 4 times [2018-11-23 11:24:04,753 INFO L223 ckRefinementStrategy]: Switched to mode CVC4_FPBP [2018-11-23 11:24:04,754 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4nyu Starting monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with cvc4nyu --tear-down-incremental --print-success --lang smt --rewrite-divk [2018-11-23 11:24:04,773 INFO L101 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 11:24:04,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 11:24:04,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is sat [2018-11-23 11:24:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 11:24:04,979 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #39#return; [?] CALL call #t~ret3 := main(); [?] havoc ~i~0;~j~0 := 10bv32;~n~0 := #t~nondet0;havoc #t~nondet0;~sn~0 := 0bv32;~i~0 := 1bv32; VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv10 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv0 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv10 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv0 32)] [?] assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv10 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv2 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv1 32), main_~j~0=(_ bv9 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv2 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv2 32), main_~j~0=(_ bv9 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv2 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv2 32), main_~j~0=(_ bv9 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv2 32)] [?] assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv2 32), main_~j~0=(_ bv9 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv4 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv2 32), main_~j~0=(_ bv8 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv4 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv3 32), main_~j~0=(_ bv8 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv4 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv3 32), main_~j~0=(_ bv8 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv4 32)] [?] assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv3 32), main_~j~0=(_ bv8 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv3 32), main_~j~0=(_ bv7 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv4 32), main_~j~0=(_ bv7 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv4 32), main_~j~0=(_ bv7 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv6 32)] [?] assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv4 32), main_~j~0=(_ bv7 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv8 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv4 32), main_~j~0=(_ bv6 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv8 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv5 32), main_~j~0=(_ bv6 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv8 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv5 32), main_~j~0=(_ bv6 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv8 32)] [?] assume ~bvslt32(~i~0, ~j~0);~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [main_~i~0=(_ bv5 32), main_~j~0=(_ bv6 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv5 32), main_~j~0=(_ bv5 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv6 32), main_~j~0=(_ bv5 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] assume !!~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv6 32), main_~j~0=(_ bv5 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] assume !~bvslt32(~i~0, ~j~0); VAL [main_~i~0=(_ bv6 32), main_~j~0=(_ bv5 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] #t~post2 := ~j~0;~j~0 := ~bvsub32(#t~post2, 1bv32);havoc #t~post2; VAL [main_~i~0=(_ bv6 32), main_~j~0=(_ bv4 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] #t~post1 := ~i~0;~i~0 := ~bvadd32(1bv32, #t~post1);havoc #t~post1; VAL [main_~i~0=(_ bv7 32), main_~j~0=(_ bv4 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] assume !~bvsle32(~i~0, ~n~0); VAL [main_~i~0=(_ bv7 32), main_~j~0=(_ bv4 32), main_~n~0=(_ bv6 32), main_~sn~0=(_ bv10 32)] [?] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [|__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] ~cond := #in~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume 0bv32 == ~cond; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] assume !false; VAL [__VERIFIER_assert_~cond=(_ bv0 32), |__VERIFIER_assert_#in~cond|=(_ bv0 32)] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14-L15] assume !~bvslt32(~i~0, ~j~0); VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14-L15] assume ~bvslt32(~i~0, ~j~0); [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] assume !!~bvsle32(~i~0, ~n~0); VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14-L15] assume !~bvslt32(~i~0, ~j~0); VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] assume !~bvsle32(~i~0, ~n~0); VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4-L6] assume 0bv32 == ~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14] COND FALSE !(~bvslt32(~i~0, ~j~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14] COND FALSE !(~bvslt32(~i~0, ~j~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14] COND FALSE !(~bvslt32(~i~0, ~j~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret3 := main(); [L12] havoc ~i~0; [L12] ~j~0 := 10bv32; [L12] ~n~0 := #t~nondet0; [L12] havoc #t~nondet0; [L12] ~sn~0 := 0bv32; [L13] ~i~0 := 1bv32; VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=0bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=1bv32, ~j~0=10bv32, ~n~0=6bv32, ~sn~0=2bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=1bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=2bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=2bv32, ~j~0=9bv32, ~n~0=6bv32, ~sn~0=4bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=2bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=4bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=3bv32, ~j~0=8bv32, ~n~0=6bv32, ~sn~0=6bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=3bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=6bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=4bv32, ~j~0=7bv32, ~n~0=6bv32, ~sn~0=8bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=4bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=8bv32] [L14] COND TRUE ~bvslt32(~i~0, ~j~0) [L15] ~sn~0 := ~bvadd32(2bv32, ~sn~0); VAL [~i~0=5bv32, ~j~0=6bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=5bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND FALSE !(!~bvsle32(~i~0, ~n~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L14] COND FALSE !(~bvslt32(~i~0, ~j~0)) VAL [~i~0=6bv32, ~j~0=5bv32, ~n~0=6bv32, ~sn~0=10bv32] [L16] #t~post2 := ~j~0; [L16] ~j~0 := ~bvsub32(#t~post2, 1bv32); [L16] havoc #t~post2; VAL [~i~0=6bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13] #t~post1 := ~i~0; [L13] ~i~0 := ~bvadd32(1bv32, #t~post1); [L13] havoc #t~post1; VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L13-L17] COND TRUE !~bvsle32(~i~0, ~n~0) VAL [~i~0=7bv32, ~j~0=4bv32, ~n~0=6bv32, ~sn~0=10bv32] [L18] CALL call __VERIFIER_assert((if ~sn~0 == ~bvmul32(2bv32, ~n~0) || 0bv32 == ~sn~0 then 1bv32 else 0bv32)); VAL [#in~cond=0bv32] [L3-L8] ~cond := #in~cond; VAL [#in~cond=0bv32, ~cond=0bv32] [L4] COND TRUE 0bv32 == ~cond VAL [#in~cond=0bv32, ~cond=0bv32] [L5] assert false; VAL [#in~cond=0bv32, ~cond=0bv32] [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, j=10, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, j=10, n=0, n=6] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i