/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/sum01_bug02.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-46f3038-m [2020-07-08 12:45:50,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-08 12:45:50,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-08 12:45:50,529 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-08 12:45:50,530 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-08 12:45:50,531 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-08 12:45:50,533 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-08 12:45:50,535 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-08 12:45:50,537 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-08 12:45:50,538 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-08 12:45:50,539 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-08 12:45:50,540 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-08 12:45:50,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-08 12:45:50,542 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-08 12:45:50,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-08 12:45:50,546 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-08 12:45:50,547 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-08 12:45:50,548 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-08 12:45:50,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-08 12:45:50,553 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-08 12:45:50,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-08 12:45:50,556 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-08 12:45:50,558 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-08 12:45:50,559 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-08 12:45:50,561 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-08 12:45:50,562 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-08 12:45:50,562 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-08 12:45:50,563 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-08 12:45:50,564 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-08 12:45:50,565 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-08 12:45:50,566 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-08 12:45:50,567 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-08 12:45:50,568 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-08 12:45:50,569 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-08 12:45:50,570 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-08 12:45:50,570 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-08 12:45:50,571 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-08 12:45:50,571 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-08 12:45:50,571 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-08 12:45:50,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-08 12:45:50,573 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-08 12:45:50,574 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-08 12:45:50,589 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-08 12:45:50,590 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-08 12:45:50,591 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-08 12:45:50,591 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-08 12:45:50,591 INFO L138 SettingsManager]: * Use SBE=true [2020-07-08 12:45:50,592 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-08 12:45:50,592 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-08 12:45:50,592 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-08 12:45:50,592 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-08 12:45:50,593 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-08 12:45:50,593 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-08 12:45:50,593 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-08 12:45:50,593 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-08 12:45:50,593 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-08 12:45:50,594 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-08 12:45:50,594 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-08 12:45:50,594 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-08 12:45:50,594 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-08 12:45:50,594 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-08 12:45:50,595 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-08 12:45:50,595 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-08 12:45:50,595 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:50,596 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-08 12:45:50,596 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-08 12:45:50,596 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-08 12:45:50,596 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-08 12:45:50,596 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-08 12:45:50,597 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-08 12:45:50,597 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-08 12:45:50,597 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-08 12:45:50,924 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-08 12:45:50,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-08 12:45:50,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-08 12:45:50,945 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-08 12:45:50,945 INFO L275 PluginConnector]: CDTParser initialized [2020-07-08 12:45:50,946 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-08 12:45:51,038 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7820f90d/6578efd41f854b4d811318c1386e00db/FLAGacd534064 [2020-07-08 12:45:51,603 INFO L306 CDTParser]: Found 1 translation units. [2020-07-08 12:45:51,604 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01_bug02.i [2020-07-08 12:45:51,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7820f90d/6578efd41f854b4d811318c1386e00db/FLAGacd534064 [2020-07-08 12:45:51,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7820f90d/6578efd41f854b4d811318c1386e00db [2020-07-08 12:45:51,940 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-08 12:45:51,943 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-08 12:45:51,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:51,945 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-08 12:45:51,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-08 12:45:51,950 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:51" (1/1) ... [2020-07-08 12:45:51,955 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@752db89d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:51, skipping insertion in model container [2020-07-08 12:45:51,955 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.07 12:45:51" (1/1) ... [2020-07-08 12:45:51,964 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-08 12:45:51,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-08 12:45:52,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:52,180 INFO L203 MainTranslator]: Completed pre-run [2020-07-08 12:45:52,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-08 12:45:52,221 INFO L208 MainTranslator]: Completed translation [2020-07-08 12:45:52,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52 WrapperNode [2020-07-08 12:45:52,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-08 12:45:52,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-08 12:45:52,224 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-08 12:45:52,224 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-08 12:45:52,241 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,264 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... [2020-07-08 12:45:52,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-08 12:45:52,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-08 12:45:52,361 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-08 12:45:52,361 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-08 12:45:52,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-08 12:45:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-08 12:45:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-08 12:45:52,440 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-08 12:45:52,441 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-08 12:45:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-08 12:45:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-08 12:45:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-08 12:45:52,441 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-08 12:45:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-08 12:45:52,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-08 12:45:52,715 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-08 12:45:52,715 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-08 12:45:52,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:52 BoogieIcfgContainer [2020-07-08 12:45:52,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-08 12:45:52,722 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-08 12:45:52,722 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-08 12:45:52,727 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-08 12:45:52,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.07 12:45:51" (1/3) ... [2020-07-08 12:45:52,729 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8b673f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:52, skipping insertion in model container [2020-07-08 12:45:52,729 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.07 12:45:52" (2/3) ... [2020-07-08 12:45:52,730 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8b673f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.07 12:45:52, skipping insertion in model container [2020-07-08 12:45:52,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.07 12:45:52" (3/3) ... [2020-07-08 12:45:52,733 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01_bug02.i [2020-07-08 12:45:52,746 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-08 12:45:52,760 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-08 12:45:52,784 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-08 12:45:52,822 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-08 12:45:52,823 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-08 12:45:52,823 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-08 12:45:52,823 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-08 12:45:52,823 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-08 12:45:52,824 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-08 12:45:52,824 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-08 12:45:52,824 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-08 12:45:52,851 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-08 12:45:52,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:45:52,864 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:52,865 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:52,866 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:52,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:52,874 INFO L82 PathProgramCache]: Analyzing trace with hash -146959038, now seen corresponding path program 1 times [2020-07-08 12:45:52,889 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:52,890 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720365024] [2020-07-08 12:45:52,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:53,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:53,115 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:45:53,116 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2020-07-08 12:45:53,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-08 12:45:53,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-08 12:45:53,120 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #39#return; {23#true} is VALID [2020-07-08 12:45:53,120 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret3 := main(); {23#true} is VALID [2020-07-08 12:45:53,121 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {23#true} is VALID [2020-07-08 12:45:53,123 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume !true; {24#false} is VALID [2020-07-08 12:45:53,123 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {24#false} is VALID [2020-07-08 12:45:53,124 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-08 12:45:53,124 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-08 12:45:53,124 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-08 12:45:53,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:53,128 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720365024] [2020-07-08 12:45:53,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:53,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-08 12:45:53,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240355176] [2020-07-08 12:45:53,138 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:45:53,141 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:53,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-08 12:45:53,180 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:53,180 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-08 12:45:53,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:53,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-08 12:45:53,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:53,192 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-08 12:45:53,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,263 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2020-07-08 12:45:53,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-08 12:45:53,264 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-08 12:45:53,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:53,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:53,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2020-07-08 12:45:53,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-08 12:45:53,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 35 transitions. [2020-07-08 12:45:53,282 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 35 transitions. [2020-07-08 12:45:53,398 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:53,426 INFO L225 Difference]: With dead ends: 31 [2020-07-08 12:45:53,427 INFO L226 Difference]: Without dead ends: 14 [2020-07-08 12:45:53,435 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-08 12:45:53,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2020-07-08 12:45:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2020-07-08 12:45:53,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:53,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states. [2020-07-08 12:45:53,505 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:45:53,505 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:45:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,515 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-08 12:45:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:45:53,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:53,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:53,517 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states. [2020-07-08 12:45:53,517 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states. [2020-07-08 12:45:53,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,521 INFO L93 Difference]: Finished difference Result 14 states and 15 transitions. [2020-07-08 12:45:53,521 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:45:53,522 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:53,522 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:53,522 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:53,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:53,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2020-07-08 12:45:53,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2020-07-08 12:45:53,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 10 [2020-07-08 12:45:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:53,528 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2020-07-08 12:45:53,529 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-08 12:45:53,529 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2020-07-08 12:45:53,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-08 12:45:53,530 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:53,530 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:53,531 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-08 12:45:53,531 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:53,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:53,532 INFO L82 PathProgramCache]: Analyzing trace with hash -158964811, now seen corresponding path program 1 times [2020-07-08 12:45:53,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:53,532 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708770623] [2020-07-08 12:45:53,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:53,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:53,659 INFO L280 TraceCheckUtils]: 0: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-08 12:45:53,660 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {118#true} {118#true} #39#return; {118#true} is VALID [2020-07-08 12:45:53,660 INFO L263 TraceCheckUtils]: 0: Hoare triple {118#true} call ULTIMATE.init(); {118#true} is VALID [2020-07-08 12:45:53,661 INFO L280 TraceCheckUtils]: 1: Hoare triple {118#true} assume true; {118#true} is VALID [2020-07-08 12:45:53,661 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {118#true} {118#true} #39#return; {118#true} is VALID [2020-07-08 12:45:53,662 INFO L263 TraceCheckUtils]: 3: Hoare triple {118#true} call #t~ret3 := main(); {118#true} is VALID [2020-07-08 12:45:53,663 INFO L280 TraceCheckUtils]: 4: Hoare triple {118#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {122#(= 0 main_~sn~0)} is VALID [2020-07-08 12:45:53,664 INFO L280 TraceCheckUtils]: 5: Hoare triple {122#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {122#(= 0 main_~sn~0)} is VALID [2020-07-08 12:45:53,667 INFO L263 TraceCheckUtils]: 6: Hoare triple {122#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {123#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:53,669 INFO L280 TraceCheckUtils]: 7: Hoare triple {123#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {124#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:53,670 INFO L280 TraceCheckUtils]: 8: Hoare triple {124#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {119#false} is VALID [2020-07-08 12:45:53,670 INFO L280 TraceCheckUtils]: 9: Hoare triple {119#false} assume !false; {119#false} is VALID [2020-07-08 12:45:53,672 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:53,672 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708770623] [2020-07-08 12:45:53,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:53,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-08 12:45:53,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492448922] [2020-07-08 12:45:53,675 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:45:53,675 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:53,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-08 12:45:53,695 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:53,696 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-08 12:45:53,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:53,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-08 12:45:53,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-08 12:45:53,698 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand 5 states. [2020-07-08 12:45:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,829 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:45:53,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:45:53,829 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-08 12:45:53,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:53,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:53,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-08 12:45:53,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-08 12:45:53,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2020-07-08 12:45:53,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 25 transitions. [2020-07-08 12:45:53,885 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:53,887 INFO L225 Difference]: With dead ends: 23 [2020-07-08 12:45:53,888 INFO L226 Difference]: Without dead ends: 18 [2020-07-08 12:45:53,890 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-08 12:45:53,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2020-07-08 12:45:53,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2020-07-08 12:45:53,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:53,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2020-07-08 12:45:53,903 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:45:53,903 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:45:53,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,906 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-08 12:45:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-08 12:45:53,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:53,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:53,908 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2020-07-08 12:45:53,908 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2020-07-08 12:45:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:53,911 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2020-07-08 12:45:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-08 12:45:53,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:53,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:53,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:53,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:53,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-08 12:45:53,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2020-07-08 12:45:53,916 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 10 [2020-07-08 12:45:53,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:53,916 INFO L479 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2020-07-08 12:45:53,916 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-08 12:45:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2020-07-08 12:45:53,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-07-08 12:45:53,917 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:53,918 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:53,918 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-08 12:45:53,919 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:53,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:53,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1017948080, now seen corresponding path program 1 times [2020-07-08 12:45:53,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:53,920 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599583763] [2020-07-08 12:45:53,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:53,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:54,292 INFO L280 TraceCheckUtils]: 0: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 12:45:54,293 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-08 12:45:54,293 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-08 12:45:54,294 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 12:45:54,294 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-08 12:45:54,294 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret3 := main(); {224#true} is VALID [2020-07-08 12:45:54,296 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {228#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:54,297 INFO L280 TraceCheckUtils]: 5: Hoare triple {228#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {229#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:54,299 INFO L280 TraceCheckUtils]: 6: Hoare triple {229#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 12:45:54,300 INFO L280 TraceCheckUtils]: 7: Hoare triple {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 12:45:54,302 INFO L280 TraceCheckUtils]: 8: Hoare triple {230#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {231#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 12:45:54,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {231#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {232#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-08 12:45:54,305 INFO L263 TraceCheckUtils]: 10: Hoare triple {232#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:54,306 INFO L280 TraceCheckUtils]: 11: Hoare triple {233#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {234#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:54,307 INFO L280 TraceCheckUtils]: 12: Hoare triple {234#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {225#false} is VALID [2020-07-08 12:45:54,307 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-08 12:45:54,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:54,310 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599583763] [2020-07-08 12:45:54,311 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [621174063] [2020-07-08 12:45:54,311 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:54,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:54,347 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-08 12:45:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:54,365 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:54,598 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:45:54,677 INFO L263 TraceCheckUtils]: 0: Hoare triple {224#true} call ULTIMATE.init(); {224#true} is VALID [2020-07-08 12:45:54,677 INFO L280 TraceCheckUtils]: 1: Hoare triple {224#true} assume true; {224#true} is VALID [2020-07-08 12:45:54,677 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {224#true} {224#true} #39#return; {224#true} is VALID [2020-07-08 12:45:54,678 INFO L263 TraceCheckUtils]: 3: Hoare triple {224#true} call #t~ret3 := main(); {224#true} is VALID [2020-07-08 12:45:54,680 INFO L280 TraceCheckUtils]: 4: Hoare triple {224#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {250#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-08 12:45:54,681 INFO L280 TraceCheckUtils]: 5: Hoare triple {250#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {254#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} is VALID [2020-07-08 12:45:54,683 INFO L280 TraceCheckUtils]: 6: Hoare triple {254#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:54,684 INFO L280 TraceCheckUtils]: 7: Hoare triple {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:54,686 INFO L280 TraceCheckUtils]: 8: Hoare triple {258#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {265#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} is VALID [2020-07-08 12:45:54,687 INFO L280 TraceCheckUtils]: 9: Hoare triple {265#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {269#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-08 12:45:54,689 INFO L263 TraceCheckUtils]: 10: Hoare triple {269#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {273#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:54,691 INFO L280 TraceCheckUtils]: 11: Hoare triple {273#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {277#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:54,692 INFO L280 TraceCheckUtils]: 12: Hoare triple {277#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {225#false} is VALID [2020-07-08 12:45:54,692 INFO L280 TraceCheckUtils]: 13: Hoare triple {225#false} assume !false; {225#false} is VALID [2020-07-08 12:45:54,694 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:54,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:54,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-08 12:45:54,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201445696] [2020-07-08 12:45:54,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-08 12:45:54,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:54,697 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 12:45:54,741 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:54,742 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 12:45:54,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:54,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 12:45:54,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:45:54,744 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand 16 states. [2020-07-08 12:45:55,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:55,529 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-08 12:45:55,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-08 12:45:55,530 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 14 [2020-07-08 12:45:55,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:55,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:45:55,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-08 12:45:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:45:55,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-08 12:45:55,539 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2020-07-08 12:45:55,619 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:55,622 INFO L225 Difference]: With dead ends: 40 [2020-07-08 12:45:55,623 INFO L226 Difference]: Without dead ends: 34 [2020-07-08 12:45:55,624 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:45:55,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-08 12:45:55,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2020-07-08 12:45:55,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:55,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 27 states. [2020-07-08 12:45:55,657 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 27 states. [2020-07-08 12:45:55,657 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 27 states. [2020-07-08 12:45:55,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:55,661 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-08 12:45:55,661 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-08 12:45:55,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:55,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:55,662 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 34 states. [2020-07-08 12:45:55,663 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 34 states. [2020-07-08 12:45:55,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:55,667 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2020-07-08 12:45:55,667 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2020-07-08 12:45:55,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:55,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:55,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:55,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:55,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-08 12:45:55,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2020-07-08 12:45:55,671 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 14 [2020-07-08 12:45:55,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:55,672 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2020-07-08 12:45:55,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 12:45:55,672 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2020-07-08 12:45:55,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:45:55,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:55,673 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:55,889 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-08 12:45:55,890 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:55,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:55,891 INFO L82 PathProgramCache]: Analyzing trace with hash -852639511, now seen corresponding path program 1 times [2020-07-08 12:45:55,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:55,892 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855805454] [2020-07-08 12:45:55,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:55,937 INFO L280 TraceCheckUtils]: 0: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-08 12:45:55,938 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {451#true} {451#true} #39#return; {451#true} is VALID [2020-07-08 12:45:55,939 INFO L263 TraceCheckUtils]: 0: Hoare triple {451#true} call ULTIMATE.init(); {451#true} is VALID [2020-07-08 12:45:55,939 INFO L280 TraceCheckUtils]: 1: Hoare triple {451#true} assume true; {451#true} is VALID [2020-07-08 12:45:55,939 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {451#true} {451#true} #39#return; {451#true} is VALID [2020-07-08 12:45:55,939 INFO L263 TraceCheckUtils]: 3: Hoare triple {451#true} call #t~ret3 := main(); {451#true} is VALID [2020-07-08 12:45:55,941 INFO L280 TraceCheckUtils]: 4: Hoare triple {451#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {455#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:55,942 INFO L280 TraceCheckUtils]: 5: Hoare triple {455#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {455#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:55,943 INFO L280 TraceCheckUtils]: 6: Hoare triple {455#(<= (+ main_~i~0 9) main_~j~0)} assume !(~i~0 < ~j~0); {452#false} is VALID [2020-07-08 12:45:55,943 INFO L280 TraceCheckUtils]: 7: Hoare triple {452#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {452#false} is VALID [2020-07-08 12:45:55,943 INFO L280 TraceCheckUtils]: 8: Hoare triple {452#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {452#false} is VALID [2020-07-08 12:45:55,944 INFO L280 TraceCheckUtils]: 9: Hoare triple {452#false} assume !!(~i~0 <= ~n~0); {452#false} is VALID [2020-07-08 12:45:55,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {452#false} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {452#false} is VALID [2020-07-08 12:45:55,944 INFO L280 TraceCheckUtils]: 11: Hoare triple {452#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {452#false} is VALID [2020-07-08 12:45:55,945 INFO L280 TraceCheckUtils]: 12: Hoare triple {452#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {452#false} is VALID [2020-07-08 12:45:55,945 INFO L280 TraceCheckUtils]: 13: Hoare triple {452#false} assume !(~i~0 <= ~n~0); {452#false} is VALID [2020-07-08 12:45:55,945 INFO L263 TraceCheckUtils]: 14: Hoare triple {452#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {452#false} is VALID [2020-07-08 12:45:55,945 INFO L280 TraceCheckUtils]: 15: Hoare triple {452#false} ~cond := #in~cond; {452#false} is VALID [2020-07-08 12:45:55,946 INFO L280 TraceCheckUtils]: 16: Hoare triple {452#false} assume 0 == ~cond; {452#false} is VALID [2020-07-08 12:45:55,946 INFO L280 TraceCheckUtils]: 17: Hoare triple {452#false} assume !false; {452#false} is VALID [2020-07-08 12:45:55,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-08 12:45:55,947 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855805454] [2020-07-08 12:45:55,947 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-08 12:45:55,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-08 12:45:55,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467575684] [2020-07-08 12:45:55,949 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:45:55,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:55,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-08 12:45:55,980 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:55,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-08 12:45:55,981 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:55,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-08 12:45:55,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:55,982 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states. [2020-07-08 12:45:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,038 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2020-07-08 12:45:56,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-08 12:45:56,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-08 12:45:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:56,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:56,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-08 12:45:56,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-08 12:45:56,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-07-08 12:45:56,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 29 transitions. [2020-07-08 12:45:56,078 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:56,080 INFO L225 Difference]: With dead ends: 36 [2020-07-08 12:45:56,080 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:45:56,081 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-08 12:45:56,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:45:56,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 12:45:56,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:56,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,096 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,097 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,099 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:45:56,099 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:45:56,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:56,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:56,100 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,100 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,103 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-08 12:45:56,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:45:56,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:56,104 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:56,104 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:56,104 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:56,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:45:56,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-08 12:45:56,106 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 18 [2020-07-08 12:45:56,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:56,107 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-08 12:45:56,107 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-08 12:45:56,107 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-08 12:45:56,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-08 12:45:56,108 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:56,108 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:56,108 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-08 12:45:56,109 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:56,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:56,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1920151575, now seen corresponding path program 2 times [2020-07-08 12:45:56,110 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:56,110 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918559200] [2020-07-08 12:45:56,110 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:56,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:56,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:56,230 INFO L280 TraceCheckUtils]: 0: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-08 12:45:56,230 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-08 12:45:56,231 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-08 12:45:56,231 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-08 12:45:56,232 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-08 12:45:56,232 INFO L263 TraceCheckUtils]: 3: Hoare triple {587#true} call #t~ret3 := main(); {587#true} is VALID [2020-07-08 12:45:56,233 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:56,235 INFO L280 TraceCheckUtils]: 5: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:56,236 INFO L280 TraceCheckUtils]: 6: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {591#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:56,238 INFO L280 TraceCheckUtils]: 7: Hoare triple {591#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {592#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-08 12:45:56,240 INFO L280 TraceCheckUtils]: 8: Hoare triple {592#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {593#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:45:56,242 INFO L280 TraceCheckUtils]: 9: Hoare triple {593#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {593#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:45:56,243 INFO L280 TraceCheckUtils]: 10: Hoare triple {593#(<= (+ main_~i~0 7) main_~j~0)} assume !(~i~0 < ~j~0); {588#false} is VALID [2020-07-08 12:45:56,244 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {588#false} is VALID [2020-07-08 12:45:56,244 INFO L280 TraceCheckUtils]: 12: Hoare triple {588#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {588#false} is VALID [2020-07-08 12:45:56,244 INFO L280 TraceCheckUtils]: 13: Hoare triple {588#false} assume !(~i~0 <= ~n~0); {588#false} is VALID [2020-07-08 12:45:56,245 INFO L263 TraceCheckUtils]: 14: Hoare triple {588#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {588#false} is VALID [2020-07-08 12:45:56,245 INFO L280 TraceCheckUtils]: 15: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-08 12:45:56,245 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-08 12:45:56,245 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-08 12:45:56,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:56,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918559200] [2020-07-08 12:45:56,247 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841274205] [2020-07-08 12:45:56,248 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:56,277 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:45:56,278 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:56,279 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-08 12:45:56,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:56,289 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:56,390 INFO L263 TraceCheckUtils]: 0: Hoare triple {587#true} call ULTIMATE.init(); {587#true} is VALID [2020-07-08 12:45:56,391 INFO L280 TraceCheckUtils]: 1: Hoare triple {587#true} assume true; {587#true} is VALID [2020-07-08 12:45:56,392 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {587#true} {587#true} #39#return; {587#true} is VALID [2020-07-08 12:45:56,392 INFO L263 TraceCheckUtils]: 3: Hoare triple {587#true} call #t~ret3 := main(); {587#true} is VALID [2020-07-08 12:45:56,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {587#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:56,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:56,396 INFO L280 TraceCheckUtils]: 6: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:56,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {609#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {619#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:56,399 INFO L280 TraceCheckUtils]: 8: Hoare triple {619#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:45:56,399 INFO L280 TraceCheckUtils]: 9: Hoare triple {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:45:56,408 INFO L280 TraceCheckUtils]: 10: Hoare triple {623#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !(~i~0 < ~j~0); {588#false} is VALID [2020-07-08 12:45:56,408 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {588#false} is VALID [2020-07-08 12:45:56,408 INFO L280 TraceCheckUtils]: 12: Hoare triple {588#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {588#false} is VALID [2020-07-08 12:45:56,409 INFO L280 TraceCheckUtils]: 13: Hoare triple {588#false} assume !(~i~0 <= ~n~0); {588#false} is VALID [2020-07-08 12:45:56,409 INFO L263 TraceCheckUtils]: 14: Hoare triple {588#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {588#false} is VALID [2020-07-08 12:45:56,409 INFO L280 TraceCheckUtils]: 15: Hoare triple {588#false} ~cond := #in~cond; {588#false} is VALID [2020-07-08 12:45:56,409 INFO L280 TraceCheckUtils]: 16: Hoare triple {588#false} assume 0 == ~cond; {588#false} is VALID [2020-07-08 12:45:56,410 INFO L280 TraceCheckUtils]: 17: Hoare triple {588#false} assume !false; {588#false} is VALID [2020-07-08 12:45:56,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:56,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:56,412 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2020-07-08 12:45:56,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238632351] [2020-07-08 12:45:56,416 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:56,417 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:56,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-08 12:45:56,452 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:56,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-08 12:45:56,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:56,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-08 12:45:56,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:56,453 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 8 states. [2020-07-08 12:45:56,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,549 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2020-07-08 12:45:56,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-08 12:45:56,549 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2020-07-08 12:45:56,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:56,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:56,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:45:56,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-08 12:45:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-08 12:45:56,554 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-08 12:45:56,607 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:56,608 INFO L225 Difference]: With dead ends: 32 [2020-07-08 12:45:56,609 INFO L226 Difference]: Without dead ends: 23 [2020-07-08 12:45:56,609 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2020-07-08 12:45:56,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-08 12:45:56,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-08 12:45:56,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:56,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,622 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,622 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,624 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 12:45:56,624 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 12:45:56,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:56,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:56,625 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,625 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-08 12:45:56,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:56,627 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2020-07-08 12:45:56,627 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 12:45:56,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:56,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:56,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:56,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:56,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-08 12:45:56,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2020-07-08 12:45:56,630 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2020-07-08 12:45:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:56,631 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2020-07-08 12:45:56,631 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-08 12:45:56,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2020-07-08 12:45:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:45:56,632 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:56,632 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:56,846 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:56,847 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:56,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:56,848 INFO L82 PathProgramCache]: Analyzing trace with hash -1780946716, now seen corresponding path program 3 times [2020-07-08 12:45:56,849 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:56,849 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703498703] [2020-07-08 12:45:56,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:57,005 INFO L280 TraceCheckUtils]: 0: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-08 12:45:57,006 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-08 12:45:57,007 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-08 12:45:57,007 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-08 12:45:57,007 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-08 12:45:57,007 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret3 := main(); {774#true} is VALID [2020-07-08 12:45:57,010 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:57,011 INFO L280 TraceCheckUtils]: 5: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:57,013 INFO L280 TraceCheckUtils]: 6: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {778#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:45:57,030 INFO L280 TraceCheckUtils]: 7: Hoare triple {778#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {779#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-08 12:45:57,032 INFO L280 TraceCheckUtils]: 8: Hoare triple {779#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:45:57,033 INFO L280 TraceCheckUtils]: 9: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:45:57,034 INFO L280 TraceCheckUtils]: 10: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {780#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:45:57,035 INFO L280 TraceCheckUtils]: 11: Hoare triple {780#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {781#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 12:45:57,036 INFO L280 TraceCheckUtils]: 12: Hoare triple {781#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {782#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:45:57,037 INFO L280 TraceCheckUtils]: 13: Hoare triple {782#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {782#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:45:57,041 INFO L280 TraceCheckUtils]: 14: Hoare triple {782#(<= (+ main_~i~0 5) main_~j~0)} assume !(~i~0 < ~j~0); {775#false} is VALID [2020-07-08 12:45:57,041 INFO L280 TraceCheckUtils]: 15: Hoare triple {775#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {775#false} is VALID [2020-07-08 12:45:57,041 INFO L280 TraceCheckUtils]: 16: Hoare triple {775#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#false} is VALID [2020-07-08 12:45:57,042 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#false} assume !(~i~0 <= ~n~0); {775#false} is VALID [2020-07-08 12:45:57,042 INFO L263 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {775#false} is VALID [2020-07-08 12:45:57,042 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-08 12:45:57,043 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-08 12:45:57,043 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-08 12:45:57,044 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:57,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703498703] [2020-07-08 12:45:57,045 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275341924] [2020-07-08 12:45:57,045 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:57,078 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2020-07-08 12:45:57,078 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:57,080 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-08 12:45:57,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:57,089 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:57,250 INFO L263 TraceCheckUtils]: 0: Hoare triple {774#true} call ULTIMATE.init(); {774#true} is VALID [2020-07-08 12:45:57,250 INFO L280 TraceCheckUtils]: 1: Hoare triple {774#true} assume true; {774#true} is VALID [2020-07-08 12:45:57,251 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {774#true} {774#true} #39#return; {774#true} is VALID [2020-07-08 12:45:57,251 INFO L263 TraceCheckUtils]: 3: Hoare triple {774#true} call #t~ret3 := main(); {774#true} is VALID [2020-07-08 12:45:57,254 INFO L280 TraceCheckUtils]: 4: Hoare triple {774#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:57,257 INFO L280 TraceCheckUtils]: 5: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:57,258 INFO L280 TraceCheckUtils]: 6: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:57,259 INFO L280 TraceCheckUtils]: 7: Hoare triple {798#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {808#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:45:57,260 INFO L280 TraceCheckUtils]: 8: Hoare triple {808#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:45:57,262 INFO L280 TraceCheckUtils]: 9: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:45:57,263 INFO L280 TraceCheckUtils]: 10: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:45:57,264 INFO L280 TraceCheckUtils]: 11: Hoare triple {812#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {822#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-08 12:45:57,265 INFO L280 TraceCheckUtils]: 12: Hoare triple {822#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:45:57,266 INFO L280 TraceCheckUtils]: 13: Hoare triple {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:45:57,267 INFO L280 TraceCheckUtils]: 14: Hoare triple {826#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !(~i~0 < ~j~0); {775#false} is VALID [2020-07-08 12:45:57,267 INFO L280 TraceCheckUtils]: 15: Hoare triple {775#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {775#false} is VALID [2020-07-08 12:45:57,267 INFO L280 TraceCheckUtils]: 16: Hoare triple {775#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#false} is VALID [2020-07-08 12:45:57,268 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#false} assume !(~i~0 <= ~n~0); {775#false} is VALID [2020-07-08 12:45:57,268 INFO L263 TraceCheckUtils]: 18: Hoare triple {775#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {775#false} is VALID [2020-07-08 12:45:57,268 INFO L280 TraceCheckUtils]: 19: Hoare triple {775#false} ~cond := #in~cond; {775#false} is VALID [2020-07-08 12:45:57,268 INFO L280 TraceCheckUtils]: 20: Hoare triple {775#false} assume 0 == ~cond; {775#false} is VALID [2020-07-08 12:45:57,269 INFO L280 TraceCheckUtils]: 21: Hoare triple {775#false} assume !false; {775#false} is VALID [2020-07-08 12:45:57,270 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 7 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:57,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:57,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2020-07-08 12:45:57,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946010176] [2020-07-08 12:45:57,272 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-07-08 12:45:57,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:57,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-08 12:45:57,322 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:57,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-08 12:45:57,322 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-08 12:45:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:45:57,324 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 12 states. [2020-07-08 12:45:57,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:57,553 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2020-07-08 12:45:57,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-08 12:45:57,554 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2020-07-08 12:45:57,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:57,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:45:57,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-08 12:45:57,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-08 12:45:57,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 37 transitions. [2020-07-08 12:45:57,558 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 37 transitions. [2020-07-08 12:45:57,610 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:57,612 INFO L225 Difference]: With dead ends: 34 [2020-07-08 12:45:57,612 INFO L226 Difference]: Without dead ends: 25 [2020-07-08 12:45:57,613 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2020-07-08 12:45:57,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2020-07-08 12:45:57,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2020-07-08 12:45:57,637 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:45:57,637 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand 24 states. [2020-07-08 12:45:57,637 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 24 states. [2020-07-08 12:45:57,637 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 24 states. [2020-07-08 12:45:57,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:57,641 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 12:45:57,642 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 12:45:57,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:57,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:57,643 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand 25 states. [2020-07-08 12:45:57,643 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 25 states. [2020-07-08 12:45:57,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:57,645 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2020-07-08 12:45:57,648 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2020-07-08 12:45:57,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:45:57,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:45:57,649 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:45:57,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:45:57,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-08 12:45:57,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2020-07-08 12:45:57,655 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 22 [2020-07-08 12:45:57,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:45:57,655 INFO L479 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2020-07-08 12:45:57,655 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-08 12:45:57,657 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2020-07-08 12:45:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-07-08 12:45:57,659 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:45:57,659 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:45:57,872 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:57,873 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:45:57,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:45:57,874 INFO L82 PathProgramCache]: Analyzing trace with hash -971600090, now seen corresponding path program 2 times [2020-07-08 12:45:57,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:45:57,875 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518493200] [2020-07-08 12:45:57,875 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:45:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:58,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:58,204 INFO L280 TraceCheckUtils]: 0: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-08 12:45:58,205 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-08 12:45:58,205 INFO L263 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {984#true} is VALID [2020-07-08 12:45:58,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-08 12:45:58,206 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-08 12:45:58,206 INFO L263 TraceCheckUtils]: 3: Hoare triple {984#true} call #t~ret3 := main(); {984#true} is VALID [2020-07-08 12:45:58,207 INFO L280 TraceCheckUtils]: 4: Hoare triple {984#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,210 INFO L280 TraceCheckUtils]: 5: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,212 INFO L280 TraceCheckUtils]: 6: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-08 12:45:58,212 INFO L280 TraceCheckUtils]: 7: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-08 12:45:58,213 INFO L280 TraceCheckUtils]: 8: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,214 INFO L280 TraceCheckUtils]: 9: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,216 INFO L280 TraceCheckUtils]: 10: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-08 12:45:58,216 INFO L280 TraceCheckUtils]: 11: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-08 12:45:58,217 INFO L280 TraceCheckUtils]: 12: Hoare triple {989#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,218 INFO L280 TraceCheckUtils]: 13: Hoare triple {988#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {990#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-08 12:45:58,219 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 12:45:58,219 INFO L280 TraceCheckUtils]: 15: Hoare triple {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} is VALID [2020-07-08 12:45:58,220 INFO L280 TraceCheckUtils]: 16: Hoare triple {991#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) main_~sn~0)))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {992#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} is VALID [2020-07-08 12:45:58,221 INFO L280 TraceCheckUtils]: 17: Hoare triple {992#(and (<= main_~sn~0 (* 2 main_~n~0)) (or (<= (* 2 main_~n~0) main_~sn~0) (<= (* 2 main_~i~0) (+ main_~sn~0 2))))} assume !(~i~0 <= ~n~0); {993#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-08 12:45:58,222 INFO L263 TraceCheckUtils]: 18: Hoare triple {993#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {994#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-08 12:45:58,224 INFO L280 TraceCheckUtils]: 19: Hoare triple {994#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {995#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-08 12:45:58,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {995#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {985#false} is VALID [2020-07-08 12:45:58,228 INFO L280 TraceCheckUtils]: 21: Hoare triple {985#false} assume !false; {985#false} is VALID [2020-07-08 12:45:58,230 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-07-08 12:45:58,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518493200] [2020-07-08 12:45:58,231 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [611016432] [2020-07-08 12:45:58,231 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:45:58,272 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-08 12:45:58,273 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:45:58,274 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-08 12:45:58,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:45:58,285 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:45:58,621 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-08 12:45:58,701 INFO L263 TraceCheckUtils]: 0: Hoare triple {984#true} call ULTIMATE.init(); {984#true} is VALID [2020-07-08 12:45:58,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {984#true} assume true; {984#true} is VALID [2020-07-08 12:45:58,702 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {984#true} {984#true} #39#return; {984#true} is VALID [2020-07-08 12:45:58,703 INFO L263 TraceCheckUtils]: 3: Hoare triple {984#true} call #t~ret3 := main(); {984#true} is VALID [2020-07-08 12:45:58,704 INFO L280 TraceCheckUtils]: 4: Hoare triple {984#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-08 12:45:58,704 INFO L280 TraceCheckUtils]: 5: Hoare triple {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-08 12:45:58,705 INFO L280 TraceCheckUtils]: 6: Hoare triple {1011#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:58,706 INFO L280 TraceCheckUtils]: 7: Hoare triple {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:58,706 INFO L280 TraceCheckUtils]: 8: Hoare triple {1018#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:58,707 INFO L280 TraceCheckUtils]: 9: Hoare triple {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-08 12:45:58,708 INFO L280 TraceCheckUtils]: 10: Hoare triple {1025#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-08 12:45:58,709 INFO L280 TraceCheckUtils]: 11: Hoare triple {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-08 12:45:58,710 INFO L280 TraceCheckUtils]: 12: Hoare triple {1032#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1039#(and (= 3 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-08 12:45:58,711 INFO L280 TraceCheckUtils]: 13: Hoare triple {1039#(and (= 3 main_~i~0) (= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0); {1043#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} is VALID [2020-07-08 12:45:58,712 INFO L280 TraceCheckUtils]: 14: Hoare triple {1043#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-08 12:45:58,713 INFO L280 TraceCheckUtils]: 15: Hoare triple {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-08 12:45:58,715 INFO L280 TraceCheckUtils]: 16: Hoare triple {1047#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1054#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-08 12:45:58,715 INFO L280 TraceCheckUtils]: 17: Hoare triple {1054#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {1058#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-08 12:45:58,717 INFO L263 TraceCheckUtils]: 18: Hoare triple {1058#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1062#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-08 12:45:58,718 INFO L280 TraceCheckUtils]: 19: Hoare triple {1062#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1066#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-08 12:45:58,727 INFO L280 TraceCheckUtils]: 20: Hoare triple {1066#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {985#false} is VALID [2020-07-08 12:45:58,727 INFO L280 TraceCheckUtils]: 21: Hoare triple {985#false} assume !false; {985#false} is VALID [2020-07-08 12:45:58,729 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:45:58,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:45:58,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-07-08 12:45:58,731 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621290464] [2020-07-08 12:45:58,732 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2020-07-08 12:45:58,733 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:45:58,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-08 12:45:58,784 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:45:58,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-08 12:45:58,785 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:45:58,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-08 12:45:58,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-08 12:45:58,787 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 21 states. [2020-07-08 12:45:59,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:45:59,949 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-08 12:45:59,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-08 12:45:59,949 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 22 [2020-07-08 12:45:59,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:45:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:45:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-08 12:45:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-08 12:45:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-08 12:45:59,955 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2020-07-08 12:46:00,027 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:00,029 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:46:00,029 INFO L226 Difference]: Without dead ends: 36 [2020-07-08 12:46:00,031 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2020-07-08 12:46:00,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-08 12:46:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2020-07-08 12:46:00,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:00,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 28 states. [2020-07-08 12:46:00,058 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 28 states. [2020-07-08 12:46:00,058 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 28 states. [2020-07-08 12:46:00,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,060 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-08 12:46:00,062 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-08 12:46:00,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,062 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 36 states. [2020-07-08 12:46:00,063 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 36 states. [2020-07-08 12:46:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:00,066 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2020-07-08 12:46:00,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2020-07-08 12:46:00,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:00,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:00,069 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:00,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:00,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-08 12:46:00,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2020-07-08 12:46:00,073 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2020-07-08 12:46:00,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:00,073 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2020-07-08 12:46:00,073 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-08 12:46:00,073 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-08 12:46:00,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-08 12:46:00,074 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:00,074 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:00,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:00,276 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:00,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:00,276 INFO L82 PathProgramCache]: Analyzing trace with hash -131462049, now seen corresponding path program 4 times [2020-07-08 12:46:00,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:00,277 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117713796] [2020-07-08 12:46:00,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:00,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,431 INFO L280 TraceCheckUtils]: 0: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 12:46:00,432 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-08 12:46:00,432 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1268#true} is VALID [2020-07-08 12:46:00,432 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 12:46:00,433 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-08 12:46:00,433 INFO L263 TraceCheckUtils]: 3: Hoare triple {1268#true} call #t~ret3 := main(); {1268#true} is VALID [2020-07-08 12:46:00,434 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:00,435 INFO L280 TraceCheckUtils]: 5: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:00,436 INFO L280 TraceCheckUtils]: 6: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1272#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:00,437 INFO L280 TraceCheckUtils]: 7: Hoare triple {1272#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1273#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-08 12:46:00,439 INFO L280 TraceCheckUtils]: 8: Hoare triple {1273#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:00,439 INFO L280 TraceCheckUtils]: 9: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:00,440 INFO L280 TraceCheckUtils]: 10: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1274#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:00,441 INFO L280 TraceCheckUtils]: 11: Hoare triple {1274#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1275#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 12:46:00,442 INFO L280 TraceCheckUtils]: 12: Hoare triple {1275#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:00,443 INFO L280 TraceCheckUtils]: 13: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:00,443 INFO L280 TraceCheckUtils]: 14: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1276#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:00,444 INFO L280 TraceCheckUtils]: 15: Hoare triple {1276#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1277#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-08 12:46:00,445 INFO L280 TraceCheckUtils]: 16: Hoare triple {1277#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1278#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 12:46:00,446 INFO L280 TraceCheckUtils]: 17: Hoare triple {1278#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1278#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 12:46:00,447 INFO L280 TraceCheckUtils]: 18: Hoare triple {1278#(<= (+ main_~i~0 3) main_~j~0)} assume !(~i~0 < ~j~0); {1269#false} is VALID [2020-07-08 12:46:00,447 INFO L280 TraceCheckUtils]: 19: Hoare triple {1269#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1269#false} is VALID [2020-07-08 12:46:00,447 INFO L280 TraceCheckUtils]: 20: Hoare triple {1269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1269#false} is VALID [2020-07-08 12:46:00,448 INFO L280 TraceCheckUtils]: 21: Hoare triple {1269#false} assume !(~i~0 <= ~n~0); {1269#false} is VALID [2020-07-08 12:46:00,448 INFO L263 TraceCheckUtils]: 22: Hoare triple {1269#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1269#false} is VALID [2020-07-08 12:46:00,448 INFO L280 TraceCheckUtils]: 23: Hoare triple {1269#false} ~cond := #in~cond; {1269#false} is VALID [2020-07-08 12:46:00,449 INFO L280 TraceCheckUtils]: 24: Hoare triple {1269#false} assume 0 == ~cond; {1269#false} is VALID [2020-07-08 12:46:00,449 INFO L280 TraceCheckUtils]: 25: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-08 12:46:00,450 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:00,450 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117713796] [2020-07-08 12:46:00,451 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758896761] [2020-07-08 12:46:00,451 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:00,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-08 12:46:00,495 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:00,496 INFO L264 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-08 12:46:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:00,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:00,725 INFO L263 TraceCheckUtils]: 0: Hoare triple {1268#true} call ULTIMATE.init(); {1268#true} is VALID [2020-07-08 12:46:00,725 INFO L280 TraceCheckUtils]: 1: Hoare triple {1268#true} assume true; {1268#true} is VALID [2020-07-08 12:46:00,725 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1268#true} {1268#true} #39#return; {1268#true} is VALID [2020-07-08 12:46:00,726 INFO L263 TraceCheckUtils]: 3: Hoare triple {1268#true} call #t~ret3 := main(); {1268#true} is VALID [2020-07-08 12:46:00,727 INFO L280 TraceCheckUtils]: 4: Hoare triple {1268#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:00,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:00,728 INFO L280 TraceCheckUtils]: 6: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:00,729 INFO L280 TraceCheckUtils]: 7: Hoare triple {1294#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1304#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:00,730 INFO L280 TraceCheckUtils]: 8: Hoare triple {1304#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:00,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:00,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:00,732 INFO L280 TraceCheckUtils]: 11: Hoare triple {1308#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1318#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:00,733 INFO L280 TraceCheckUtils]: 12: Hoare triple {1318#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:00,733 INFO L280 TraceCheckUtils]: 13: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:00,734 INFO L280 TraceCheckUtils]: 14: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:00,734 INFO L280 TraceCheckUtils]: 15: Hoare triple {1322#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1332#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:00,735 INFO L280 TraceCheckUtils]: 16: Hoare triple {1332#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:00,737 INFO L280 TraceCheckUtils]: 17: Hoare triple {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !!(~i~0 <= ~n~0); {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:00,739 INFO L280 TraceCheckUtils]: 18: Hoare triple {1336#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !(~i~0 < ~j~0); {1269#false} is VALID [2020-07-08 12:46:00,739 INFO L280 TraceCheckUtils]: 19: Hoare triple {1269#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1269#false} is VALID [2020-07-08 12:46:00,739 INFO L280 TraceCheckUtils]: 20: Hoare triple {1269#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1269#false} is VALID [2020-07-08 12:46:00,740 INFO L280 TraceCheckUtils]: 21: Hoare triple {1269#false} assume !(~i~0 <= ~n~0); {1269#false} is VALID [2020-07-08 12:46:00,740 INFO L263 TraceCheckUtils]: 22: Hoare triple {1269#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1269#false} is VALID [2020-07-08 12:46:00,740 INFO L280 TraceCheckUtils]: 23: Hoare triple {1269#false} ~cond := #in~cond; {1269#false} is VALID [2020-07-08 12:46:00,740 INFO L280 TraceCheckUtils]: 24: Hoare triple {1269#false} assume 0 == ~cond; {1269#false} is VALID [2020-07-08 12:46:00,741 INFO L280 TraceCheckUtils]: 25: Hoare triple {1269#false} assume !false; {1269#false} is VALID [2020-07-08 12:46:00,742 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:00,743 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:00,743 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-08 12:46:00,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957424380] [2020-07-08 12:46:00,744 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-07-08 12:46:00,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:00,744 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-08 12:46:00,801 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:00,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-08 12:46:00,802 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:00,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-08 12:46:00,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:46:00,803 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 16 states. [2020-07-08 12:46:01,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,119 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-08 12:46:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-08 12:46:01,119 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2020-07-08 12:46:01,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:01,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:46:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:46:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-08 12:46:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 41 transitions. [2020-07-08 12:46:01,123 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 41 transitions. [2020-07-08 12:46:01,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:01,173 INFO L225 Difference]: With dead ends: 42 [2020-07-08 12:46:01,173 INFO L226 Difference]: Without dead ends: 33 [2020-07-08 12:46:01,174 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2020-07-08 12:46:01,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-08 12:46:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-08 12:46:01,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:01,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-08 12:46:01,197 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-08 12:46:01,197 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-08 12:46:01,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,199 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-08 12:46:01,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-08 12:46:01,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,200 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-08 12:46:01,200 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-08 12:46:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:01,202 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2020-07-08 12:46:01,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-08 12:46:01,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:01,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:01,203 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:01,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:01,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-08 12:46:01,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2020-07-08 12:46:01,204 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 26 [2020-07-08 12:46:01,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:01,205 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2020-07-08 12:46:01,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-08 12:46:01,205 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2020-07-08 12:46:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2020-07-08 12:46:01,205 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:01,206 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:01,418 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:01,419 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:01,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:01,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1107887526, now seen corresponding path program 5 times [2020-07-08 12:46:01,420 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:01,420 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996207539] [2020-07-08 12:46:01,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,588 INFO L280 TraceCheckUtils]: 0: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-08 12:46:01,589 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-08 12:46:01,589 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-08 12:46:01,590 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-08 12:46:01,590 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-08 12:46:01,590 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret3 := main(); {1530#true} is VALID [2020-07-08 12:46:01,597 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:01,598 INFO L280 TraceCheckUtils]: 5: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} assume !!(~i~0 <= ~n~0); {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:01,599 INFO L280 TraceCheckUtils]: 6: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1534#(<= (+ main_~i~0 9) main_~j~0)} is VALID [2020-07-08 12:46:01,600 INFO L280 TraceCheckUtils]: 7: Hoare triple {1534#(<= (+ main_~i~0 9) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1535#(<= (+ main_~i~0 8) main_~j~0)} is VALID [2020-07-08 12:46:01,601 INFO L280 TraceCheckUtils]: 8: Hoare triple {1535#(<= (+ main_~i~0 8) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:01,602 INFO L280 TraceCheckUtils]: 9: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} assume !!(~i~0 <= ~n~0); {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:01,603 INFO L280 TraceCheckUtils]: 10: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1536#(<= (+ main_~i~0 7) main_~j~0)} is VALID [2020-07-08 12:46:01,604 INFO L280 TraceCheckUtils]: 11: Hoare triple {1536#(<= (+ main_~i~0 7) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1537#(<= (+ main_~i~0 6) main_~j~0)} is VALID [2020-07-08 12:46:01,605 INFO L280 TraceCheckUtils]: 12: Hoare triple {1537#(<= (+ main_~i~0 6) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:01,605 INFO L280 TraceCheckUtils]: 13: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} assume !!(~i~0 <= ~n~0); {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:01,606 INFO L280 TraceCheckUtils]: 14: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1538#(<= (+ main_~i~0 5) main_~j~0)} is VALID [2020-07-08 12:46:01,607 INFO L280 TraceCheckUtils]: 15: Hoare triple {1538#(<= (+ main_~i~0 5) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1539#(<= (+ main_~i~0 4) main_~j~0)} is VALID [2020-07-08 12:46:01,608 INFO L280 TraceCheckUtils]: 16: Hoare triple {1539#(<= (+ main_~i~0 4) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 12:46:01,609 INFO L280 TraceCheckUtils]: 17: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} assume !!(~i~0 <= ~n~0); {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 12:46:01,609 INFO L280 TraceCheckUtils]: 18: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1540#(<= (+ main_~i~0 3) main_~j~0)} is VALID [2020-07-08 12:46:01,611 INFO L280 TraceCheckUtils]: 19: Hoare triple {1540#(<= (+ main_~i~0 3) main_~j~0)} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1541#(<= (+ main_~i~0 2) main_~j~0)} is VALID [2020-07-08 12:46:01,612 INFO L280 TraceCheckUtils]: 20: Hoare triple {1541#(<= (+ main_~i~0 2) main_~j~0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1542#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-08 12:46:01,612 INFO L280 TraceCheckUtils]: 21: Hoare triple {1542#(<= (+ main_~i~0 1) main_~j~0)} assume !!(~i~0 <= ~n~0); {1542#(<= (+ main_~i~0 1) main_~j~0)} is VALID [2020-07-08 12:46:01,613 INFO L280 TraceCheckUtils]: 22: Hoare triple {1542#(<= (+ main_~i~0 1) main_~j~0)} assume !(~i~0 < ~j~0); {1531#false} is VALID [2020-07-08 12:46:01,613 INFO L280 TraceCheckUtils]: 23: Hoare triple {1531#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1531#false} is VALID [2020-07-08 12:46:01,614 INFO L280 TraceCheckUtils]: 24: Hoare triple {1531#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#false} is VALID [2020-07-08 12:46:01,614 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#false} assume !(~i~0 <= ~n~0); {1531#false} is VALID [2020-07-08 12:46:01,614 INFO L263 TraceCheckUtils]: 26: Hoare triple {1531#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1531#false} is VALID [2020-07-08 12:46:01,615 INFO L280 TraceCheckUtils]: 27: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-08 12:46:01,615 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-08 12:46:01,616 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-08 12:46:01,618 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:01,618 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996207539] [2020-07-08 12:46:01,619 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057154764] [2020-07-08 12:46:01,619 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:01,657 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-07-08 12:46:01,657 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-08 12:46:01,659 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-08 12:46:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-08 12:46:01,671 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-08 12:46:01,914 INFO L263 TraceCheckUtils]: 0: Hoare triple {1530#true} call ULTIMATE.init(); {1530#true} is VALID [2020-07-08 12:46:01,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {1530#true} assume true; {1530#true} is VALID [2020-07-08 12:46:01,915 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1530#true} {1530#true} #39#return; {1530#true} is VALID [2020-07-08 12:46:01,915 INFO L263 TraceCheckUtils]: 3: Hoare triple {1530#true} call #t~ret3 := main(); {1530#true} is VALID [2020-07-08 12:46:01,916 INFO L280 TraceCheckUtils]: 4: Hoare triple {1530#true} havoc ~i~0;~j~0 := 10;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:01,917 INFO L280 TraceCheckUtils]: 5: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume !!(~i~0 <= ~n~0); {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:01,918 INFO L280 TraceCheckUtils]: 6: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:01,918 INFO L280 TraceCheckUtils]: 7: Hoare triple {1558#(and (<= 10 main_~j~0) (<= main_~i~0 1))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1568#(and (<= 9 main_~j~0) (<= main_~i~0 1))} is VALID [2020-07-08 12:46:01,919 INFO L280 TraceCheckUtils]: 8: Hoare triple {1568#(and (<= 9 main_~j~0) (<= main_~i~0 1))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:01,920 INFO L280 TraceCheckUtils]: 9: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume !!(~i~0 <= ~n~0); {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:01,921 INFO L280 TraceCheckUtils]: 10: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} is VALID [2020-07-08 12:46:01,922 INFO L280 TraceCheckUtils]: 11: Hoare triple {1572#(and (<= 9 main_~j~0) (<= main_~i~0 2))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1582#(and (<= main_~i~0 2) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:01,923 INFO L280 TraceCheckUtils]: 12: Hoare triple {1582#(and (<= main_~i~0 2) (<= 8 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:01,924 INFO L280 TraceCheckUtils]: 13: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume !!(~i~0 <= ~n~0); {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:01,925 INFO L280 TraceCheckUtils]: 14: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} is VALID [2020-07-08 12:46:01,925 INFO L280 TraceCheckUtils]: 15: Hoare triple {1586#(and (<= main_~i~0 3) (<= 8 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1596#(and (<= main_~i~0 3) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:01,926 INFO L280 TraceCheckUtils]: 16: Hoare triple {1596#(and (<= main_~i~0 3) (<= 7 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:01,927 INFO L280 TraceCheckUtils]: 17: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume !!(~i~0 <= ~n~0); {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:01,928 INFO L280 TraceCheckUtils]: 18: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} assume ~i~0 < ~j~0;~sn~0 := 2 + ~sn~0; {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} is VALID [2020-07-08 12:46:01,929 INFO L280 TraceCheckUtils]: 19: Hoare triple {1600#(and (<= main_~i~0 4) (<= 7 main_~j~0))} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1610#(and (<= main_~i~0 4) (<= 6 main_~j~0))} is VALID [2020-07-08 12:46:01,930 INFO L280 TraceCheckUtils]: 20: Hoare triple {1610#(and (<= main_~i~0 4) (<= 6 main_~j~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} is VALID [2020-07-08 12:46:01,932 INFO L280 TraceCheckUtils]: 21: Hoare triple {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} assume !!(~i~0 <= ~n~0); {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} is VALID [2020-07-08 12:46:01,934 INFO L280 TraceCheckUtils]: 22: Hoare triple {1614#(and (<= main_~i~0 5) (<= 6 main_~j~0))} assume !(~i~0 < ~j~0); {1531#false} is VALID [2020-07-08 12:46:01,934 INFO L280 TraceCheckUtils]: 23: Hoare triple {1531#false} #t~post2 := ~j~0;~j~0 := #t~post2 - 1;havoc #t~post2; {1531#false} is VALID [2020-07-08 12:46:01,934 INFO L280 TraceCheckUtils]: 24: Hoare triple {1531#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#false} is VALID [2020-07-08 12:46:01,934 INFO L280 TraceCheckUtils]: 25: Hoare triple {1531#false} assume !(~i~0 <= ~n~0); {1531#false} is VALID [2020-07-08 12:46:01,935 INFO L263 TraceCheckUtils]: 26: Hoare triple {1531#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1531#false} is VALID [2020-07-08 12:46:01,935 INFO L280 TraceCheckUtils]: 27: Hoare triple {1531#false} ~cond := #in~cond; {1531#false} is VALID [2020-07-08 12:46:01,935 INFO L280 TraceCheckUtils]: 28: Hoare triple {1531#false} assume 0 == ~cond; {1531#false} is VALID [2020-07-08 12:46:01,935 INFO L280 TraceCheckUtils]: 29: Hoare triple {1531#false} assume !false; {1531#false} is VALID [2020-07-08 12:46:01,938 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 13 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-08 12:46:01,938 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-08 12:46:01,938 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2020-07-08 12:46:01,939 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335416555] [2020-07-08 12:46:01,939 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-07-08 12:46:01,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-08 12:46:01,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states. [2020-07-08 12:46:02,005 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:02,005 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-07-08 12:46:02,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-08 12:46:02,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-07-08 12:46:02,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:46:02,006 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 20 states. [2020-07-08 12:46:02,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,297 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2020-07-08 12:46:02,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-07-08 12:46:02,298 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 30 [2020-07-08 12:46:02,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-08 12:46:02,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:46:02,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 12:46:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-08 12:46:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 46 transitions. [2020-07-08 12:46:02,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 46 transitions. [2020-07-08 12:46:02,366 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-08 12:46:02,368 INFO L225 Difference]: With dead ends: 47 [2020-07-08 12:46:02,368 INFO L226 Difference]: Without dead ends: 38 [2020-07-08 12:46:02,369 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2020-07-08 12:46:02,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-08 12:46:02,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2020-07-08 12:46:02,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-08 12:46:02,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 36 states. [2020-07-08 12:46:02,399 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 36 states. [2020-07-08 12:46:02,399 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 36 states. [2020-07-08 12:46:02,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,402 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-08 12:46:02,402 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-08 12:46:02,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:02,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:02,403 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 38 states. [2020-07-08 12:46:02,403 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 38 states. [2020-07-08 12:46:02,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-08 12:46:02,405 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2020-07-08 12:46:02,405 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2020-07-08 12:46:02,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-08 12:46:02,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-08 12:46:02,406 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-08 12:46:02,406 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-08 12:46:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-08 12:46:02,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-08 12:46:02,407 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 30 [2020-07-08 12:46:02,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-08 12:46:02,407 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-08 12:46:02,408 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-07-08 12:46:02,408 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-08 12:46:02,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-08 12:46:02,408 INFO L414 BasicCegarLoop]: Found error trace [2020-07-08 12:46:02,409 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-08 12:46:02,617 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-08 12:46:02,618 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-08 12:46:02,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-08 12:46:02,618 INFO L82 PathProgramCache]: Analyzing trace with hash -682200363, now seen corresponding path program 6 times [2020-07-08 12:46:02,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-08 12:46:02,619 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776050130] [2020-07-08 12:46:02,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-08 12:46:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:46:02,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-08 12:46:02,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-08 12:46:02,713 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-08 12:46:02,713 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-08 12:46:02,745 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-08 12:46:02,745 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:46:02,745 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-08 12:46:02,746 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 12:46:02,747 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-08 12:46:02,748 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-08 12:46:02,749 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-08 12:46:02,749 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-08 12:46:02,749 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-08 12:46:02,749 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-08 12:46:02,749 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-08 12:46:02,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.07 12:46:02 BoogieIcfgContainer [2020-07-08 12:46:02,753 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-08 12:46:02,757 INFO L168 Benchmark]: Toolchain (without parser) took 10814.25 ms. Allocated memory was 143.7 MB in the beginning and 309.3 MB in the end (delta: 165.7 MB). Free memory was 101.4 MB in the beginning and 99.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 168.1 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,758 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,759 INFO L168 Benchmark]: CACSL2BoogieTranslator took 278.28 ms. Allocated memory is still 143.7 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,760 INFO L168 Benchmark]: Boogie Preprocessor took 137.35 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,760 INFO L168 Benchmark]: RCFGBuilder took 359.30 ms. Allocated memory is still 200.8 MB. Free memory was 180.9 MB in the beginning and 163.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,761 INFO L168 Benchmark]: TraceAbstraction took 10031.45 ms. Allocated memory was 200.8 MB in the beginning and 309.3 MB in the end (delta: 108.5 MB). Free memory was 163.1 MB in the beginning and 99.0 MB in the end (delta: 64.1 MB). Peak memory consumption was 172.6 MB. Max. memory is 7.1 GB. [2020-07-08 12:46:02,764 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 143.7 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 278.28 ms. Allocated memory is still 143.7 MB. Free memory was 101.2 MB in the beginning and 91.5 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 137.35 ms. Allocated memory was 143.7 MB in the beginning and 200.8 MB in the end (delta: 57.1 MB). Free memory was 91.5 MB in the beginning and 180.9 MB in the end (delta: -89.4 MB). Peak memory consumption was 11.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 359.30 ms. Allocated memory is still 200.8 MB. Free memory was 180.9 MB in the beginning and 163.8 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10031.45 ms. Allocated memory was 200.8 MB in the beginning and 309.3 MB in the end (delta: 108.5 MB). Free memory was 163.1 MB in the beginning and 99.0 MB in the end (delta: 64.1 MB). Peak memory consumption was 172.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L12] int i, 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=6, n=0] [L13] COND TRUE i<=n VAL [i=1, j=10, n=0, n=6] [L14] COND TRUE i