/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-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:50:22,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:50:22,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:50:22,285 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:50:22,285 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:50:22,286 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:50:22,288 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:50:22,289 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:50:22,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:50:22,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:50:22,293 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:50:22,294 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:50:22,294 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:50:22,295 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:50:22,296 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:50:22,297 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:50:22,298 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:50:22,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:50:22,301 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:50:22,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:50:22,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:50:22,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:50:22,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:50:22,307 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:50:22,310 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:50:22,310 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:50:22,310 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:50:22,311 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:50:22,311 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:50:22,312 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:50:22,312 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:50:22,313 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:50:22,314 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:50:22,315 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:50:22,316 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:50:22,316 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:50:22,316 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:50:22,317 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:50:22,317 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:50:22,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:50:22,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:50:22,319 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-17 22:50:22,333 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:50:22,333 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:50:22,334 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:50:22,334 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:50:22,335 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:50:22,335 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:50:22,335 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:50:22,335 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:50:22,335 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:50:22,336 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:50:22,336 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:50:22,336 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:50:22,336 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:50:22,336 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:50:22,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:50:22,337 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:50:22,337 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:50:22,337 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:50:22,337 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:50:22,338 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:50:22,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:50:22,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:50:22,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:50:22,338 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:50:22,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:50:22,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:50:22,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:50:22,339 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:50:22,339 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:50:22,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:50:22,588 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:50:22,604 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:50:22,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:50:22,608 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:50:22,608 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:50:22,609 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/sum01-1.i [2020-07-17 22:50:22,684 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d7cb718/e33afdcf336841679156dd89b3bb2cdb/FLAGfa982aeab [2020-07-17 22:50:23,169 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:50:23,170 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/sum01-1.i [2020-07-17 22:50:23,175 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d7cb718/e33afdcf336841679156dd89b3bb2cdb/FLAGfa982aeab [2020-07-17 22:50:23,591 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/57d7cb718/e33afdcf336841679156dd89b3bb2cdb [2020-07-17 22:50:23,602 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:50:23,605 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:50:23,606 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:23,606 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:50:23,610 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:50:23,612 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,615 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c3e449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23, skipping insertion in model container [2020-07-17 22:50:23,615 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,624 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:50:23,646 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:50:23,849 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:23,854 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:50:23,871 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:50:23,886 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:50:23,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23 WrapperNode [2020-07-17 22:50:23,887 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:50:23,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:50:23,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:50:23,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:50:23,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,980 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,981 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,990 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,996 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,997 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (1/1) ... [2020-07-17 22:50:23,999 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:50:24,000 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:50:24,000 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:50:24,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:50:24,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (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-17 22:50:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:50:24,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:50:24,071 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:50:24,071 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:50:24,071 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:50:24,354 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:50:24,357 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:50:24,365 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:24 BoogieIcfgContainer [2020-07-17 22:50:24,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:50:24,367 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:50:24,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:50:24,377 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:50:24,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:50:23" (1/3) ... [2020-07-17 22:50:24,379 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2fd81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:24, skipping insertion in model container [2020-07-17 22:50:24,380 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:50:23" (2/3) ... [2020-07-17 22:50:24,380 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e2fd81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:50:24, skipping insertion in model container [2020-07-17 22:50:24,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:50:24" (3/3) ... [2020-07-17 22:50:24,389 INFO L109 eAbstractionObserver]: Analyzing ICFG sum01-1.i [2020-07-17 22:50:24,404 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:50:24,412 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:50:24,426 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:50:24,453 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:50:24,453 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:50:24,454 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:50:24,454 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:50:24,454 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:50:24,454 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:50:24,454 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:50:24,454 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:50:24,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2020-07-17 22:50:24,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:24,480 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:24,481 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:24,482 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:24,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:24,488 INFO L82 PathProgramCache]: Analyzing trace with hash -721501374, now seen corresponding path program 1 times [2020-07-17 22:50:24,498 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:24,499 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901621076] [2020-07-17 22:50:24,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:24,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:24,635 INFO L280 TraceCheckUtils]: 0: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:24,636 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:24,638 INFO L263 TraceCheckUtils]: 0: Hoare triple {22#true} call ULTIMATE.init(); {22#true} is VALID [2020-07-17 22:50:24,639 INFO L280 TraceCheckUtils]: 1: Hoare triple {22#true} assume true; {22#true} is VALID [2020-07-17 22:50:24,639 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {22#true} {22#true} #37#return; {22#true} is VALID [2020-07-17 22:50:24,640 INFO L263 TraceCheckUtils]: 3: Hoare triple {22#true} call #t~ret2 := main(); {22#true} is VALID [2020-07-17 22:50:24,640 INFO L280 TraceCheckUtils]: 4: Hoare triple {22#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {22#true} is VALID [2020-07-17 22:50:24,646 INFO L280 TraceCheckUtils]: 5: Hoare triple {22#true} assume !true; {23#false} is VALID [2020-07-17 22:50:24,646 INFO L263 TraceCheckUtils]: 6: Hoare triple {23#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {23#false} is VALID [2020-07-17 22:50:24,647 INFO L280 TraceCheckUtils]: 7: Hoare triple {23#false} ~cond := #in~cond; {23#false} is VALID [2020-07-17 22:50:24,647 INFO L280 TraceCheckUtils]: 8: Hoare triple {23#false} assume 0 == ~cond; {23#false} is VALID [2020-07-17 22:50:24,648 INFO L280 TraceCheckUtils]: 9: Hoare triple {23#false} assume !false; {23#false} is VALID [2020-07-17 22:50:24,649 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-17 22:50:24,650 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901621076] [2020-07-17 22:50:24,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:24,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:50:24,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089220931] [2020-07-17 22:50:24,659 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:24,662 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:24,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:50:24,697 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-17 22:50:24,697 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:50:24,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:24,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:50:24,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:50:24,710 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2020-07-17 22:50:24,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,784 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2020-07-17 22:50:24,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:50:24,785 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:50:24,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:24,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:24,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:50:24,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 34 transitions. [2020-07-17 22:50:24,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 34 transitions. [2020-07-17 22:50:24,879 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:24,890 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:24,891 INFO L226 Difference]: Without dead ends: 13 [2020-07-17 22:50:24,895 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-17 22:50:24,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2020-07-17 22:50:24,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-07-17 22:50:24,953 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:24,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:24,954 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:24,954 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:24,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,961 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:24,962 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:24,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,963 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:24,963 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states. [2020-07-17 22:50:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:24,970 INFO L93 Difference]: Finished difference Result 13 states and 14 transitions. [2020-07-17 22:50:24,970 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:24,972 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:24,972 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:24,973 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:24,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:24,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:50:24,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 14 transitions. [2020-07-17 22:50:24,984 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 14 transitions. Word has length 10 [2020-07-17 22:50:24,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:24,984 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 14 transitions. [2020-07-17 22:50:24,985 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:50:24,985 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 14 transitions. [2020-07-17 22:50:24,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:50:24,987 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:24,987 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:24,987 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:50:24,989 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:24,991 INFO L82 PathProgramCache]: Analyzing trace with hash -731660105, now seen corresponding path program 1 times [2020-07-17 22:50:24,991 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:24,992 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348645763] [2020-07-17 22:50:24,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:25,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,161 INFO L280 TraceCheckUtils]: 0: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:25,161 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:25,162 INFO L263 TraceCheckUtils]: 0: Hoare triple {113#true} call ULTIMATE.init(); {113#true} is VALID [2020-07-17 22:50:25,162 INFO L280 TraceCheckUtils]: 1: Hoare triple {113#true} assume true; {113#true} is VALID [2020-07-17 22:50:25,162 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {113#true} {113#true} #37#return; {113#true} is VALID [2020-07-17 22:50:25,163 INFO L263 TraceCheckUtils]: 3: Hoare triple {113#true} call #t~ret2 := main(); {113#true} is VALID [2020-07-17 22:50:25,164 INFO L280 TraceCheckUtils]: 4: Hoare triple {113#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {117#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:25,166 INFO L280 TraceCheckUtils]: 5: Hoare triple {117#(= 0 main_~sn~0)} assume !(~i~0 <= ~n~0); {117#(= 0 main_~sn~0)} is VALID [2020-07-17 22:50:25,168 INFO L263 TraceCheckUtils]: 6: Hoare triple {117#(= 0 main_~sn~0)} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:25,170 INFO L280 TraceCheckUtils]: 7: Hoare triple {118#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {119#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:25,171 INFO L280 TraceCheckUtils]: 8: Hoare triple {119#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {114#false} is VALID [2020-07-17 22:50:25,172 INFO L280 TraceCheckUtils]: 9: Hoare triple {114#false} assume !false; {114#false} is VALID [2020-07-17 22:50:25,173 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-17 22:50:25,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348645763] [2020-07-17 22:50:25,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:50:25,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:50:25,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496033903] [2020-07-17 22:50:25,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:25,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:25,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:25,196 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-17 22:50:25,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:25,197 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:25,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:25,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:25,198 INFO L87 Difference]: Start difference. First operand 13 states and 14 transitions. Second operand 5 states. [2020-07-17 22:50:25,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,295 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2020-07-17 22:50:25,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:25,296 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:50:25,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:25,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:25,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:50:25,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:25,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2020-07-17 22:50:25,302 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 23 transitions. [2020-07-17 22:50:25,340 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-17 22:50:25,342 INFO L225 Difference]: With dead ends: 21 [2020-07-17 22:50:25,342 INFO L226 Difference]: Without dead ends: 16 [2020-07-17 22:50:25,344 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-17 22:50:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2020-07-17 22:50:25,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2020-07-17 22:50:25,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:25,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:25,353 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:25,353 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:25,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,356 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-17 22:50:25,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-17 22:50:25,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,357 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:25,357 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states. [2020-07-17 22:50:25,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:25,359 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions. [2020-07-17 22:50:25,359 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-17 22:50:25,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:25,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:25,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:25,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:25,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2020-07-17 22:50:25,363 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 10 [2020-07-17 22:50:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:25,363 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2020-07-17 22:50:25,363 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2020-07-17 22:50:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:50:25,364 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:25,364 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:25,365 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:50:25,365 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:25,366 INFO L82 PathProgramCache]: Analyzing trace with hash -1637338477, now seen corresponding path program 1 times [2020-07-17 22:50:25,366 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:25,366 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130641405] [2020-07-17 22:50:25,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:25,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,744 INFO L280 TraceCheckUtils]: 0: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-17 22:50:25,744 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-17 22:50:25,745 INFO L263 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2020-07-17 22:50:25,745 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-17 22:50:25,745 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-17 22:50:25,746 INFO L263 TraceCheckUtils]: 3: Hoare triple {211#true} call #t~ret2 := main(); {211#true} is VALID [2020-07-17 22:50:25,747 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:25,748 INFO L280 TraceCheckUtils]: 5: Hoare triple {215#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {216#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:25,750 INFO L280 TraceCheckUtils]: 6: Hoare triple {216#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {217#(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-17 22:50:25,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {217#(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; {218#(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-17 22:50:25,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {218#(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); {219#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-17 22:50:25,754 INFO L263 TraceCheckUtils]: 9: Hoare triple {219#(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)); {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:25,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {220#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {221#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:25,755 INFO L280 TraceCheckUtils]: 11: Hoare triple {221#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {212#false} is VALID [2020-07-17 22:50:25,756 INFO L280 TraceCheckUtils]: 12: Hoare triple {212#false} assume !false; {212#false} is VALID [2020-07-17 22:50:25,758 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-17 22:50:25,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130641405] [2020-07-17 22:50:25,758 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1956910074] [2020-07-17 22:50:25,759 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-17 22:50:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,789 INFO L264 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 12 conjunts are in the unsatisfiable core [2020-07-17 22:50:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:25,806 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:26,009 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:26,078 INFO L263 TraceCheckUtils]: 0: Hoare triple {211#true} call ULTIMATE.init(); {211#true} is VALID [2020-07-17 22:50:26,079 INFO L280 TraceCheckUtils]: 1: Hoare triple {211#true} assume true; {211#true} is VALID [2020-07-17 22:50:26,079 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {211#true} {211#true} #37#return; {211#true} is VALID [2020-07-17 22:50:26,079 INFO L263 TraceCheckUtils]: 3: Hoare triple {211#true} call #t~ret2 := main(); {211#true} is VALID [2020-07-17 22:50:26,081 INFO L280 TraceCheckUtils]: 4: Hoare triple {211#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {237#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:26,082 INFO L280 TraceCheckUtils]: 5: Hoare triple {237#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {241#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:26,084 INFO L280 TraceCheckUtils]: 6: Hoare triple {241#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {245#(and (= 1 main_~i~0) (<= main_~i~0 main_~n~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:26,085 INFO L280 TraceCheckUtils]: 7: Hoare triple {245#(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; {249#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} is VALID [2020-07-17 22:50:26,087 INFO L280 TraceCheckUtils]: 8: Hoare triple {249#(and (<= main_~i~0 2) (= 2 main_~sn~0) (<= 1 main_~n~0))} assume !(~i~0 <= ~n~0); {253#(and (= 2 main_~sn~0) (<= 1 main_~n~0) (<= main_~n~0 1))} is VALID [2020-07-17 22:50:26,089 INFO L263 TraceCheckUtils]: 9: Hoare triple {253#(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)); {257#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:26,090 INFO L280 TraceCheckUtils]: 10: Hoare triple {257#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {261#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:26,091 INFO L280 TraceCheckUtils]: 11: Hoare triple {261#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {212#false} is VALID [2020-07-17 22:50:26,091 INFO L280 TraceCheckUtils]: 12: Hoare triple {212#false} assume !false; {212#false} is VALID [2020-07-17 22:50:26,092 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-17 22:50:26,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:26,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2020-07-17 22:50:26,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850407789] [2020-07-17 22:50:26,094 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-07-17 22:50:26,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:26,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states. [2020-07-17 22:50:26,127 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:26,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2020-07-17 22:50:26,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:26,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2020-07-17 22:50:26,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=193, Unknown=0, NotChecked=0, Total=240 [2020-07-17 22:50:26,128 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 16 states. [2020-07-17 22:50:26,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,698 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2020-07-17 22:50:26,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-07-17 22:50:26,698 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 13 [2020-07-17 22:50:26,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:26,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:26,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-17 22:50:26,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-07-17 22:50:26,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 41 transitions. [2020-07-17 22:50:26,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 41 transitions. [2020-07-17 22:50:26,764 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-17 22:50:26,765 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:50:26,765 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:50:26,766 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2020-07-17 22:50:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:50:26,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2020-07-17 22:50:26,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:26,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 20 states. [2020-07-17 22:50:26,781 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 20 states. [2020-07-17 22:50:26,782 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 20 states. [2020-07-17 22:50:26,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,784 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-17 22:50:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-17 22:50:26,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,785 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 22 states. [2020-07-17 22:50:26,785 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 22 states. [2020-07-17 22:50:26,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:26,787 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2020-07-17 22:50:26,787 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2020-07-17 22:50:26,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:26,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:26,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:26,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:26,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2020-07-17 22:50:26,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2020-07-17 22:50:26,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2020-07-17 22:50:26,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:26,791 INFO L479 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2020-07-17 22:50:26,791 INFO L480 AbstractCegarLoop]: Interpolant automaton has 16 states. [2020-07-17 22:50:26,791 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2020-07-17 22:50:26,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:50:26,792 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:26,792 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,005 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:50:27,006 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1350121109, now seen corresponding path program 1 times [2020-07-17 22:50:27,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,008 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2147426357] [2020-07-17 22:50:27,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:50:27,098 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-17 22:50:27,099 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2020-07-17 22:50:27,099 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:50:27,099 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-17 22:50:27,100 INFO L263 TraceCheckUtils]: 3: Hoare triple {403#true} call #t~ret2 := main(); {403#true} is VALID [2020-07-17 22:50:27,101 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,102 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,102 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,103 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,104 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,106 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {409#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:27,107 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {409#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:27,108 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(<= main_~i~0 3)} assume !(~i~0 < 10); {404#false} is VALID [2020-07-17 22:50:27,108 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {404#false} is VALID [2020-07-17 22:50:27,109 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#false} assume !(~i~0 <= ~n~0); {404#false} is VALID [2020-07-17 22:50:27,109 INFO L263 TraceCheckUtils]: 15: Hoare triple {404#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {404#false} is VALID [2020-07-17 22:50:27,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-17 22:50:27,110 INFO L280 TraceCheckUtils]: 17: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-17 22:50:27,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-17 22:50:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:27,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2147426357] [2020-07-17 22:50:27,111 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778281341] [2020-07-17 22:50:27,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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-17 22:50:27,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,136 INFO L264 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2020-07-17 22:50:27,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,143 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:27,204 INFO L263 TraceCheckUtils]: 0: Hoare triple {403#true} call ULTIMATE.init(); {403#true} is VALID [2020-07-17 22:50:27,205 INFO L280 TraceCheckUtils]: 1: Hoare triple {403#true} assume true; {403#true} is VALID [2020-07-17 22:50:27,205 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {403#true} {403#true} #37#return; {403#true} is VALID [2020-07-17 22:50:27,205 INFO L263 TraceCheckUtils]: 3: Hoare triple {403#true} call #t~ret2 := main(); {403#true} is VALID [2020-07-17 22:50:27,206 INFO L280 TraceCheckUtils]: 4: Hoare triple {403#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,207 INFO L280 TraceCheckUtils]: 5: Hoare triple {407#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,209 INFO L280 TraceCheckUtils]: 6: Hoare triple {407#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {407#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:27,210 INFO L280 TraceCheckUtils]: 7: Hoare triple {407#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,210 INFO L280 TraceCheckUtils]: 8: Hoare triple {408#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,211 INFO L280 TraceCheckUtils]: 9: Hoare triple {408#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {408#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:27,212 INFO L280 TraceCheckUtils]: 10: Hoare triple {408#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {409#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:27,212 INFO L280 TraceCheckUtils]: 11: Hoare triple {409#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {409#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:27,214 INFO L280 TraceCheckUtils]: 12: Hoare triple {409#(<= main_~i~0 3)} assume !(~i~0 < 10); {404#false} is VALID [2020-07-17 22:50:27,214 INFO L280 TraceCheckUtils]: 13: Hoare triple {404#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {404#false} is VALID [2020-07-17 22:50:27,215 INFO L280 TraceCheckUtils]: 14: Hoare triple {404#false} assume !(~i~0 <= ~n~0); {404#false} is VALID [2020-07-17 22:50:27,215 INFO L263 TraceCheckUtils]: 15: Hoare triple {404#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {404#false} is VALID [2020-07-17 22:50:27,215 INFO L280 TraceCheckUtils]: 16: Hoare triple {404#false} ~cond := #in~cond; {404#false} is VALID [2020-07-17 22:50:27,216 INFO L280 TraceCheckUtils]: 17: Hoare triple {404#false} assume 0 == ~cond; {404#false} is VALID [2020-07-17 22:50:27,216 INFO L280 TraceCheckUtils]: 18: Hoare triple {404#false} assume !false; {404#false} is VALID [2020-07-17 22:50:27,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:27,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:27,217 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-07-17 22:50:27,217 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117890244] [2020-07-17 22:50:27,218 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:50:27,218 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:27,218 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:50:27,250 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:27,250 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:50:27,250 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:27,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:50:27,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:27,251 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2020-07-17 22:50:27,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,352 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2020-07-17 22:50:27,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:50:27,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2020-07-17 22:50:27,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:27,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:50:27,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:50:27,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2020-07-17 22:50:27,357 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2020-07-17 22:50:27,401 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-17 22:50:27,403 INFO L225 Difference]: With dead ends: 30 [2020-07-17 22:50:27,403 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:50:27,404 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:50:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:50:27,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2020-07-17 22:50:27,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:27,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:27,419 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:27,419 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 21 states. [2020-07-17 22:50:27,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,422 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:50:27,422 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:50:27,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,423 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:27,423 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 22 states. [2020-07-17 22:50:27,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:27,425 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:50:27,425 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:50:27,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:27,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:27,426 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:27,426 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:27,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:27,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2020-07-17 22:50:27,428 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2020-07-17 22:50:27,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:27,428 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2020-07-17 22:50:27,428 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:50:27,428 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2020-07-17 22:50:27,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2020-07-17 22:50:27,429 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:27,429 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:27,632 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:27,632 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:27,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash -424886253, now seen corresponding path program 2 times [2020-07-17 22:50:27,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:27,634 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573194323] [2020-07-17 22:50:27,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:27,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:27,939 INFO L280 TraceCheckUtils]: 0: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-17 22:50:27,939 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-17 22:50:27,940 INFO L263 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {584#true} is VALID [2020-07-17 22:50:27,940 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-17 22:50:27,940 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-17 22:50:27,940 INFO L263 TraceCheckUtils]: 3: Hoare triple {584#true} call #t~ret2 := main(); {584#true} is VALID [2020-07-17 22:50:27,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,942 INFO L280 TraceCheckUtils]: 5: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,943 INFO L280 TraceCheckUtils]: 6: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {589#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:27,945 INFO L280 TraceCheckUtils]: 7: Hoare triple {589#(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; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,946 INFO L280 TraceCheckUtils]: 8: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,947 INFO L280 TraceCheckUtils]: 9: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {589#(and (<= main_~sn~0 (* 2 main_~i~0)) (<= (* 2 main_~i~0) main_~sn~0))} is VALID [2020-07-17 22:50:27,949 INFO L280 TraceCheckUtils]: 10: Hoare triple {589#(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; {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,950 INFO L280 TraceCheckUtils]: 11: Hoare triple {588#(and (<= (+ main_~sn~0 2) (* 2 main_~i~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume !!(~i~0 <= ~n~0); {590#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} is VALID [2020-07-17 22:50:27,952 INFO L280 TraceCheckUtils]: 12: Hoare triple {590#(and (<= (+ main_~sn~0 2) (* 2 main_~n~0)) (<= (* 2 main_~i~0) (+ main_~sn~0 2)))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {591#(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-17 22:50:27,954 INFO L280 TraceCheckUtils]: 13: Hoare triple {591#(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; {592#(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-17 22:50:27,955 INFO L280 TraceCheckUtils]: 14: Hoare triple {592#(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); {593#(and (<= main_~sn~0 (* 2 main_~n~0)) (<= (* 2 main_~n~0) main_~sn~0))} is VALID [2020-07-17 22:50:27,956 INFO L263 TraceCheckUtils]: 15: Hoare triple {593#(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)); {594#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:50:27,957 INFO L280 TraceCheckUtils]: 16: Hoare triple {594#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {595#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-17 22:50:27,957 INFO L280 TraceCheckUtils]: 17: Hoare triple {595#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {585#false} is VALID [2020-07-17 22:50:27,958 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#false} assume !false; {585#false} is VALID [2020-07-17 22:50:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2020-07-17 22:50:27,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573194323] [2020-07-17 22:50:27,960 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1540574114] [2020-07-17 22:50:27,960 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 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-17 22:50:27,996 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:27,996 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:27,997 INFO L264 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 20 conjunts are in the unsatisfiable core [2020-07-17 22:50:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:28,012 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:28,328 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-07-17 22:50:28,389 INFO L263 TraceCheckUtils]: 0: Hoare triple {584#true} call ULTIMATE.init(); {584#true} is VALID [2020-07-17 22:50:28,389 INFO L280 TraceCheckUtils]: 1: Hoare triple {584#true} assume true; {584#true} is VALID [2020-07-17 22:50:28,389 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {584#true} {584#true} #37#return; {584#true} is VALID [2020-07-17 22:50:28,389 INFO L263 TraceCheckUtils]: 3: Hoare triple {584#true} call #t~ret2 := main(); {584#true} is VALID [2020-07-17 22:50:28,390 INFO L280 TraceCheckUtils]: 4: Hoare triple {584#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:28,391 INFO L280 TraceCheckUtils]: 5: Hoare triple {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume !!(~i~0 <= ~n~0); {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} is VALID [2020-07-17 22:50:28,392 INFO L280 TraceCheckUtils]: 6: Hoare triple {611#(and (= 1 main_~i~0) (= 0 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {618#(and (= 1 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,392 INFO L280 TraceCheckUtils]: 7: Hoare triple {618#(and (= 1 main_~i~0) (= 2 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,394 INFO L280 TraceCheckUtils]: 8: Hoare triple {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume !!(~i~0 <= ~n~0); {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} is VALID [2020-07-17 22:50:28,397 INFO L280 TraceCheckUtils]: 9: Hoare triple {622#(and (= 2 main_~i~0) (= 2 main_~sn~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {629#(and (= 2 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:28,401 INFO L280 TraceCheckUtils]: 10: Hoare triple {629#(and (= 2 main_~i~0) (= 4 main_~sn~0))} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {633#(and (= 3 main_~i~0) (= 4 main_~sn~0))} is VALID [2020-07-17 22:50:28,402 INFO L280 TraceCheckUtils]: 11: Hoare triple {633#(and (= 3 main_~i~0) (= 4 main_~sn~0))} assume !!(~i~0 <= ~n~0); {637#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} is VALID [2020-07-17 22:50:28,403 INFO L280 TraceCheckUtils]: 12: Hoare triple {637#(and (= 3 main_~i~0) (= 4 main_~sn~0) (<= main_~i~0 main_~n~0))} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {641#(and (= 3 main_~i~0) (<= main_~i~0 main_~n~0) (= 6 main_~sn~0))} is VALID [2020-07-17 22:50:28,404 INFO L280 TraceCheckUtils]: 13: Hoare triple {641#(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; {645#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:28,405 INFO L280 TraceCheckUtils]: 14: Hoare triple {645#(and (<= main_~i~0 4) (= 6 main_~sn~0) (<= 3 main_~n~0))} assume !(~i~0 <= ~n~0); {649#(and (<= main_~n~0 3) (= 6 main_~sn~0) (<= 3 main_~n~0))} is VALID [2020-07-17 22:50:28,407 INFO L263 TraceCheckUtils]: 15: Hoare triple {649#(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)); {653#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:50:28,407 INFO L280 TraceCheckUtils]: 16: Hoare triple {653#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {657#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:50:28,408 INFO L280 TraceCheckUtils]: 17: Hoare triple {657#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {585#false} is VALID [2020-07-17 22:50:28,408 INFO L280 TraceCheckUtils]: 18: Hoare triple {585#false} assume !false; {585#false} is VALID [2020-07-17 22:50:28,409 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:28,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:28,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 21 [2020-07-17 22:50:28,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249447135] [2020-07-17 22:50:28,411 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2020-07-17 22:50:28,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:28,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-17 22:50:28,456 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:28,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-17 22:50:28,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:28,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-17 22:50:28,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2020-07-17 22:50:28,458 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 21 states. [2020-07-17 22:50:29,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,490 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2020-07-17 22:50:29,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2020-07-17 22:50:29,490 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 19 [2020-07-17 22:50:29,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:29,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:29,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-17 22:50:29,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:50:29,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 46 transitions. [2020-07-17 22:50:29,497 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 46 transitions. [2020-07-17 22:50:29,553 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-17 22:50:29,554 INFO L225 Difference]: With dead ends: 40 [2020-07-17 22:50:29,554 INFO L226 Difference]: Without dead ends: 28 [2020-07-17 22:50:29,556 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=163, Invalid=1027, Unknown=0, NotChecked=0, Total=1190 [2020-07-17 22:50:29,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-17 22:50:29,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-17 22:50:29,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:29,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-17 22:50:29,585 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-17 22:50:29,585 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-17 22:50:29,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,587 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-17 22:50:29,587 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-17 22:50:29,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,588 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-17 22:50:29,588 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-17 22:50:29,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:29,590 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2020-07-17 22:50:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2020-07-17 22:50:29,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:29,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:29,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:29,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:29,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:50:29,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:50:29,593 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2020-07-17 22:50:29,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:29,593 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:50:29,594 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-17 22:50:29,594 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:50:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-07-17 22:50:29,594 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:29,595 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:29,805 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:29,806 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:29,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash -1753373675, now seen corresponding path program 2 times [2020-07-17 22:50:29,807 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:29,808 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700827740] [2020-07-17 22:50:29,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,882 INFO L280 TraceCheckUtils]: 0: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-17 22:50:29,882 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-17 22:50:29,883 INFO L263 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2020-07-17 22:50:29,883 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-17 22:50:29,883 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-17 22:50:29,884 INFO L263 TraceCheckUtils]: 3: Hoare triple {844#true} call #t~ret2 := main(); {844#true} is VALID [2020-07-17 22:50:29,884 INFO L280 TraceCheckUtils]: 4: Hoare triple {844#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,885 INFO L280 TraceCheckUtils]: 5: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,886 INFO L280 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,887 INFO L280 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,887 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,888 INFO L280 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,889 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,889 INFO L280 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,890 INFO L280 TraceCheckUtils]: 12: Hoare triple {850#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:29,891 INFO L280 TraceCheckUtils]: 13: Hoare triple {850#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:29,892 INFO L280 TraceCheckUtils]: 14: Hoare triple {851#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:29,892 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:29,893 INFO L280 TraceCheckUtils]: 16: Hoare triple {851#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {852#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:29,894 INFO L280 TraceCheckUtils]: 17: Hoare triple {852#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {852#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:29,895 INFO L280 TraceCheckUtils]: 18: Hoare triple {852#(<= main_~i~0 5)} assume !(~i~0 < 10); {845#false} is VALID [2020-07-17 22:50:29,895 INFO L280 TraceCheckUtils]: 19: Hoare triple {845#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {845#false} is VALID [2020-07-17 22:50:29,895 INFO L280 TraceCheckUtils]: 20: Hoare triple {845#false} assume !(~i~0 <= ~n~0); {845#false} is VALID [2020-07-17 22:50:29,895 INFO L263 TraceCheckUtils]: 21: Hoare triple {845#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {845#false} is VALID [2020-07-17 22:50:29,896 INFO L280 TraceCheckUtils]: 22: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2020-07-17 22:50:29,896 INFO L280 TraceCheckUtils]: 23: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2020-07-17 22:50:29,896 INFO L280 TraceCheckUtils]: 24: Hoare triple {845#false} assume !false; {845#false} is VALID [2020-07-17 22:50:29,897 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:29,897 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700827740] [2020-07-17 22:50:29,898 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910183223] [2020-07-17 22:50:29,898 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-17 22:50:29,938 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:50:29,938 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:29,939 INFO L264 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 6 conjunts are in the unsatisfiable core [2020-07-17 22:50:29,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:29,947 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:29,996 INFO L263 TraceCheckUtils]: 0: Hoare triple {844#true} call ULTIMATE.init(); {844#true} is VALID [2020-07-17 22:50:29,996 INFO L280 TraceCheckUtils]: 1: Hoare triple {844#true} assume true; {844#true} is VALID [2020-07-17 22:50:29,996 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {844#true} {844#true} #37#return; {844#true} is VALID [2020-07-17 22:50:29,997 INFO L263 TraceCheckUtils]: 3: Hoare triple {844#true} call #t~ret2 := main(); {844#true} is VALID [2020-07-17 22:50:29,997 INFO L280 TraceCheckUtils]: 4: Hoare triple {844#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,998 INFO L280 TraceCheckUtils]: 5: Hoare triple {848#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,998 INFO L280 TraceCheckUtils]: 6: Hoare triple {848#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {848#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:29,999 INFO L280 TraceCheckUtils]: 7: Hoare triple {848#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:29,999 INFO L280 TraceCheckUtils]: 8: Hoare triple {849#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,000 INFO L280 TraceCheckUtils]: 9: Hoare triple {849#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {849#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,001 INFO L280 TraceCheckUtils]: 10: Hoare triple {849#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,003 INFO L280 TraceCheckUtils]: 11: Hoare triple {850#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,003 INFO L280 TraceCheckUtils]: 12: Hoare triple {850#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {850#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,004 INFO L280 TraceCheckUtils]: 13: Hoare triple {850#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,005 INFO L280 TraceCheckUtils]: 14: Hoare triple {851#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,005 INFO L280 TraceCheckUtils]: 15: Hoare triple {851#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {851#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,006 INFO L280 TraceCheckUtils]: 16: Hoare triple {851#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {852#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,006 INFO L280 TraceCheckUtils]: 17: Hoare triple {852#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {852#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,006 INFO L280 TraceCheckUtils]: 18: Hoare triple {852#(<= main_~i~0 5)} assume !(~i~0 < 10); {845#false} is VALID [2020-07-17 22:50:30,007 INFO L280 TraceCheckUtils]: 19: Hoare triple {845#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {845#false} is VALID [2020-07-17 22:50:30,007 INFO L280 TraceCheckUtils]: 20: Hoare triple {845#false} assume !(~i~0 <= ~n~0); {845#false} is VALID [2020-07-17 22:50:30,007 INFO L263 TraceCheckUtils]: 21: Hoare triple {845#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {845#false} is VALID [2020-07-17 22:50:30,007 INFO L280 TraceCheckUtils]: 22: Hoare triple {845#false} ~cond := #in~cond; {845#false} is VALID [2020-07-17 22:50:30,007 INFO L280 TraceCheckUtils]: 23: Hoare triple {845#false} assume 0 == ~cond; {845#false} is VALID [2020-07-17 22:50:30,007 INFO L280 TraceCheckUtils]: 24: Hoare triple {845#false} assume !false; {845#false} is VALID [2020-07-17 22:50:30,008 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:30,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 7 [2020-07-17 22:50:30,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50214282] [2020-07-17 22:50:30,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:50:30,010 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:30,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:50:30,038 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-17 22:50:30,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:50:30,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:30,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:50:30,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:30,039 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 7 states. [2020-07-17 22:50:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,166 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2020-07-17 22:50:30,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:50:30,166 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2020-07-17 22:50:30,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:30,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:30,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-17 22:50:30,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:50:30,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2020-07-17 22:50:30,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2020-07-17 22:50:30,208 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,209 INFO L225 Difference]: With dead ends: 39 [2020-07-17 22:50:30,209 INFO L226 Difference]: Without dead ends: 31 [2020-07-17 22:50:30,210 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:50:30,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-17 22:50:30,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2020-07-17 22:50:30,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:30,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 30 states. [2020-07-17 22:50:30,241 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 30 states. [2020-07-17 22:50:30,242 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 30 states. [2020-07-17 22:50:30,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,244 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-17 22:50:30,244 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-17 22:50:30,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,246 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 31 states. [2020-07-17 22:50:30,246 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 31 states. [2020-07-17 22:50:30,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,248 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-17 22:50:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2020-07-17 22:50:30,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:30,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:30,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:30,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:30,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-17 22:50:30,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2020-07-17 22:50:30,251 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 25 [2020-07-17 22:50:30,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:30,251 INFO L479 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2020-07-17 22:50:30,251 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:50:30,251 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:50:30,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2020-07-17 22:50:30,252 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:30,253 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:30,462 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:30,462 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:30,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:30,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1094958777, now seen corresponding path program 3 times [2020-07-17 22:50:30,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:30,464 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773778108] [2020-07-17 22:50:30,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:30,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,565 INFO L280 TraceCheckUtils]: 0: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:50:30,565 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-17 22:50:30,565 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-17 22:50:30,566 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:50:30,566 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-17 22:50:30,566 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret2 := main(); {1087#true} is VALID [2020-07-17 22:50:30,567 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,568 INFO L280 TraceCheckUtils]: 5: Hoare triple {1091#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,568 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,571 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,572 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,574 INFO L280 TraceCheckUtils]: 9: Hoare triple {1092#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,576 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,578 INFO L280 TraceCheckUtils]: 11: Hoare triple {1093#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,578 INFO L280 TraceCheckUtils]: 12: Hoare triple {1093#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,579 INFO L280 TraceCheckUtils]: 13: Hoare triple {1093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,580 INFO L280 TraceCheckUtils]: 14: Hoare triple {1094#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,581 INFO L280 TraceCheckUtils]: 15: Hoare triple {1094#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,582 INFO L280 TraceCheckUtils]: 16: Hoare triple {1094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,582 INFO L280 TraceCheckUtils]: 17: Hoare triple {1095#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,583 INFO L280 TraceCheckUtils]: 18: Hoare triple {1095#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,584 INFO L280 TraceCheckUtils]: 19: Hoare triple {1095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:30,585 INFO L280 TraceCheckUtils]: 20: Hoare triple {1096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1096#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:30,586 INFO L280 TraceCheckUtils]: 21: Hoare triple {1096#(<= main_~i~0 6)} assume !(~i~0 < 10); {1088#false} is VALID [2020-07-17 22:50:30,587 INFO L280 TraceCheckUtils]: 22: Hoare triple {1088#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#false} is VALID [2020-07-17 22:50:30,587 INFO L280 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !(~i~0 <= ~n~0); {1088#false} is VALID [2020-07-17 22:50:30,588 INFO L263 TraceCheckUtils]: 24: Hoare triple {1088#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1088#false} is VALID [2020-07-17 22:50:30,588 INFO L280 TraceCheckUtils]: 25: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2020-07-17 22:50:30,588 INFO L280 TraceCheckUtils]: 26: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2020-07-17 22:50:30,589 INFO L280 TraceCheckUtils]: 27: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-17 22:50:30,591 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773778108] [2020-07-17 22:50:30,591 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7699855] [2020-07-17 22:50:30,592 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 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-17 22:50:30,635 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2020-07-17 22:50:30,635 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:30,636 INFO L264 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:50:30,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:30,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:30,741 INFO L263 TraceCheckUtils]: 0: Hoare triple {1087#true} call ULTIMATE.init(); {1087#true} is VALID [2020-07-17 22:50:30,741 INFO L280 TraceCheckUtils]: 1: Hoare triple {1087#true} assume true; {1087#true} is VALID [2020-07-17 22:50:30,741 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1087#true} {1087#true} #37#return; {1087#true} is VALID [2020-07-17 22:50:30,742 INFO L263 TraceCheckUtils]: 3: Hoare triple {1087#true} call #t~ret2 := main(); {1087#true} is VALID [2020-07-17 22:50:30,743 INFO L280 TraceCheckUtils]: 4: Hoare triple {1087#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,744 INFO L280 TraceCheckUtils]: 5: Hoare triple {1091#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,745 INFO L280 TraceCheckUtils]: 6: Hoare triple {1091#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1091#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:30,747 INFO L280 TraceCheckUtils]: 7: Hoare triple {1091#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,748 INFO L280 TraceCheckUtils]: 8: Hoare triple {1092#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,749 INFO L280 TraceCheckUtils]: 9: Hoare triple {1092#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1092#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:30,751 INFO L280 TraceCheckUtils]: 10: Hoare triple {1092#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,752 INFO L280 TraceCheckUtils]: 11: Hoare triple {1093#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,752 INFO L280 TraceCheckUtils]: 12: Hoare triple {1093#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1093#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:30,754 INFO L280 TraceCheckUtils]: 13: Hoare triple {1093#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,754 INFO L280 TraceCheckUtils]: 14: Hoare triple {1094#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,755 INFO L280 TraceCheckUtils]: 15: Hoare triple {1094#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1094#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:30,756 INFO L280 TraceCheckUtils]: 16: Hoare triple {1094#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,757 INFO L280 TraceCheckUtils]: 17: Hoare triple {1095#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,758 INFO L280 TraceCheckUtils]: 18: Hoare triple {1095#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1095#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:30,760 INFO L280 TraceCheckUtils]: 19: Hoare triple {1095#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1096#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:30,761 INFO L280 TraceCheckUtils]: 20: Hoare triple {1096#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1096#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:30,762 INFO L280 TraceCheckUtils]: 21: Hoare triple {1096#(<= main_~i~0 6)} assume !(~i~0 < 10); {1088#false} is VALID [2020-07-17 22:50:30,763 INFO L280 TraceCheckUtils]: 22: Hoare triple {1088#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1088#false} is VALID [2020-07-17 22:50:30,763 INFO L280 TraceCheckUtils]: 23: Hoare triple {1088#false} assume !(~i~0 <= ~n~0); {1088#false} is VALID [2020-07-17 22:50:30,763 INFO L263 TraceCheckUtils]: 24: Hoare triple {1088#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1088#false} is VALID [2020-07-17 22:50:30,764 INFO L280 TraceCheckUtils]: 25: Hoare triple {1088#false} ~cond := #in~cond; {1088#false} is VALID [2020-07-17 22:50:30,764 INFO L280 TraceCheckUtils]: 26: Hoare triple {1088#false} assume 0 == ~cond; {1088#false} is VALID [2020-07-17 22:50:30,764 INFO L280 TraceCheckUtils]: 27: Hoare triple {1088#false} assume !false; {1088#false} is VALID [2020-07-17 22:50:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:30,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:30,767 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2020-07-17 22:50:30,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160574473] [2020-07-17 22:50:30,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-17 22:50:30,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:30,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2020-07-17 22:50:30,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:30,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-07-17 22:50:30,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:30,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-07-17 22:50:30,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:30,819 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 8 states. [2020-07-17 22:50:30,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:30,972 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2020-07-17 22:50:30,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:50:30,972 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2020-07-17 22:50:30,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:30,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:30,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-17 22:50:30,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2020-07-17 22:50:30,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 42 transitions. [2020-07-17 22:50:30,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 42 transitions. [2020-07-17 22:50:31,025 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,027 INFO L225 Difference]: With dead ends: 42 [2020-07-17 22:50:31,027 INFO L226 Difference]: Without dead ends: 34 [2020-07-17 22:50:31,027 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2020-07-17 22:50:31,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2020-07-17 22:50:31,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2020-07-17 22:50:31,051 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:31,051 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand 33 states. [2020-07-17 22:50:31,052 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 33 states. [2020-07-17 22:50:31,052 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 33 states. [2020-07-17 22:50:31,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,053 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:50:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-17 22:50:31,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,054 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 34 states. [2020-07-17 22:50:31,054 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 34 states. [2020-07-17 22:50:31,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,056 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2020-07-17 22:50:31,056 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2020-07-17 22:50:31,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,057 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:31,057 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-17 22:50:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2020-07-17 22:50:31,059 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 28 [2020-07-17 22:50:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:31,060 INFO L479 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2020-07-17 22:50:31,060 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-07-17 22:50:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2020-07-17 22:50:31,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:50:31,061 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:31,061 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:31,274 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-07-17 22:50:31,274 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:31,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:31,275 INFO L82 PathProgramCache]: Analyzing trace with hash 98169237, now seen corresponding path program 4 times [2020-07-17 22:50:31,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:31,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93564358] [2020-07-17 22:50:31,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,386 INFO L280 TraceCheckUtils]: 0: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-17 22:50:31,387 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-17 22:50:31,387 INFO L263 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2020-07-17 22:50:31,387 INFO L280 TraceCheckUtils]: 1: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-17 22:50:31,387 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-17 22:50:31,387 INFO L263 TraceCheckUtils]: 3: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2020-07-17 22:50:31,388 INFO L280 TraceCheckUtils]: 4: Hoare triple {1354#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,388 INFO L280 TraceCheckUtils]: 5: Hoare triple {1358#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,390 INFO L280 TraceCheckUtils]: 6: Hoare triple {1358#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,390 INFO L280 TraceCheckUtils]: 7: Hoare triple {1358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,391 INFO L280 TraceCheckUtils]: 8: Hoare triple {1359#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,392 INFO L280 TraceCheckUtils]: 9: Hoare triple {1359#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,394 INFO L280 TraceCheckUtils]: 10: Hoare triple {1359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,397 INFO L280 TraceCheckUtils]: 11: Hoare triple {1360#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,399 INFO L280 TraceCheckUtils]: 12: Hoare triple {1360#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,399 INFO L280 TraceCheckUtils]: 13: Hoare triple {1360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,400 INFO L280 TraceCheckUtils]: 14: Hoare triple {1361#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,400 INFO L280 TraceCheckUtils]: 15: Hoare triple {1361#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,401 INFO L280 TraceCheckUtils]: 16: Hoare triple {1361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,401 INFO L280 TraceCheckUtils]: 17: Hoare triple {1362#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,402 INFO L280 TraceCheckUtils]: 18: Hoare triple {1362#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,403 INFO L280 TraceCheckUtils]: 19: Hoare triple {1362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,403 INFO L280 TraceCheckUtils]: 20: Hoare triple {1363#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,404 INFO L280 TraceCheckUtils]: 21: Hoare triple {1363#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,404 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1364#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:31,404 INFO L280 TraceCheckUtils]: 23: Hoare triple {1364#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1364#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:31,405 INFO L280 TraceCheckUtils]: 24: Hoare triple {1364#(<= main_~i~0 7)} assume !(~i~0 < 10); {1355#false} is VALID [2020-07-17 22:50:31,405 INFO L280 TraceCheckUtils]: 25: Hoare triple {1355#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1355#false} is VALID [2020-07-17 22:50:31,405 INFO L280 TraceCheckUtils]: 26: Hoare triple {1355#false} assume !(~i~0 <= ~n~0); {1355#false} is VALID [2020-07-17 22:50:31,406 INFO L263 TraceCheckUtils]: 27: Hoare triple {1355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1355#false} is VALID [2020-07-17 22:50:31,406 INFO L280 TraceCheckUtils]: 28: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2020-07-17 22:50:31,406 INFO L280 TraceCheckUtils]: 29: Hoare triple {1355#false} assume 0 == ~cond; {1355#false} is VALID [2020-07-17 22:50:31,406 INFO L280 TraceCheckUtils]: 30: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2020-07-17 22:50:31,407 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:31,407 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93564358] [2020-07-17 22:50:31,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1944611679] [2020-07-17 22:50:31,408 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 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-17 22:50:31,433 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-07-17 22:50:31,433 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:31,434 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2020-07-17 22:50:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:31,450 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:31,520 INFO L263 TraceCheckUtils]: 0: Hoare triple {1354#true} call ULTIMATE.init(); {1354#true} is VALID [2020-07-17 22:50:31,521 INFO L280 TraceCheckUtils]: 1: Hoare triple {1354#true} assume true; {1354#true} is VALID [2020-07-17 22:50:31,521 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1354#true} {1354#true} #37#return; {1354#true} is VALID [2020-07-17 22:50:31,521 INFO L263 TraceCheckUtils]: 3: Hoare triple {1354#true} call #t~ret2 := main(); {1354#true} is VALID [2020-07-17 22:50:31,524 INFO L280 TraceCheckUtils]: 4: Hoare triple {1354#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,525 INFO L280 TraceCheckUtils]: 5: Hoare triple {1358#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,526 INFO L280 TraceCheckUtils]: 6: Hoare triple {1358#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1358#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:31,526 INFO L280 TraceCheckUtils]: 7: Hoare triple {1358#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,527 INFO L280 TraceCheckUtils]: 8: Hoare triple {1359#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,527 INFO L280 TraceCheckUtils]: 9: Hoare triple {1359#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1359#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:31,528 INFO L280 TraceCheckUtils]: 10: Hoare triple {1359#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,528 INFO L280 TraceCheckUtils]: 11: Hoare triple {1360#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,528 INFO L280 TraceCheckUtils]: 12: Hoare triple {1360#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1360#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:31,529 INFO L280 TraceCheckUtils]: 13: Hoare triple {1360#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,529 INFO L280 TraceCheckUtils]: 14: Hoare triple {1361#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,530 INFO L280 TraceCheckUtils]: 15: Hoare triple {1361#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1361#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:31,530 INFO L280 TraceCheckUtils]: 16: Hoare triple {1361#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,534 INFO L280 TraceCheckUtils]: 17: Hoare triple {1362#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,537 INFO L280 TraceCheckUtils]: 18: Hoare triple {1362#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1362#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:31,538 INFO L280 TraceCheckUtils]: 19: Hoare triple {1362#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,539 INFO L280 TraceCheckUtils]: 20: Hoare triple {1363#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,539 INFO L280 TraceCheckUtils]: 21: Hoare triple {1363#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1363#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:31,540 INFO L280 TraceCheckUtils]: 22: Hoare triple {1363#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1364#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:31,540 INFO L280 TraceCheckUtils]: 23: Hoare triple {1364#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1364#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:31,540 INFO L280 TraceCheckUtils]: 24: Hoare triple {1364#(<= main_~i~0 7)} assume !(~i~0 < 10); {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L280 TraceCheckUtils]: 25: Hoare triple {1355#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L280 TraceCheckUtils]: 26: Hoare triple {1355#false} assume !(~i~0 <= ~n~0); {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L263 TraceCheckUtils]: 27: Hoare triple {1355#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L280 TraceCheckUtils]: 28: Hoare triple {1355#false} ~cond := #in~cond; {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L280 TraceCheckUtils]: 29: Hoare triple {1355#false} assume 0 == ~cond; {1355#false} is VALID [2020-07-17 22:50:31,541 INFO L280 TraceCheckUtils]: 30: Hoare triple {1355#false} assume !false; {1355#false} is VALID [2020-07-17 22:50:31,543 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 13 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:31,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:31,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2020-07-17 22:50:31,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622838917] [2020-07-17 22:50:31,544 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:50:31,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:31,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:50:31,583 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,584 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:50:31,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:31,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:50:31,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:31,584 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 9 states. [2020-07-17 22:50:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,727 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2020-07-17 22:50:31,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-07-17 22:50:31,727 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:50:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:31,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:31,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-17 22:50:31,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:50:31,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 45 transitions. [2020-07-17 22:50:31,732 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 45 transitions. [2020-07-17 22:50:31,785 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:31,787 INFO L225 Difference]: With dead ends: 45 [2020-07-17 22:50:31,787 INFO L226 Difference]: Without dead ends: 37 [2020-07-17 22:50:31,788 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:50:31,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2020-07-17 22:50:31,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2020-07-17 22:50:31,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:31,813 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand 36 states. [2020-07-17 22:50:31,813 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 36 states. [2020-07-17 22:50:31,813 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 36 states. [2020-07-17 22:50:31,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,815 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:50:31,816 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:50:31,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,816 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 37 states. [2020-07-17 22:50:31,816 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 37 states. [2020-07-17 22:50:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:31,818 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2020-07-17 22:50:31,819 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2020-07-17 22:50:31,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:31,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:31,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:31,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:31,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-17 22:50:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2020-07-17 22:50:31,821 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 31 [2020-07-17 22:50:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:31,822 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2020-07-17 22:50:31,822 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:50:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2020-07-17 22:50:31,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:50:31,823 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:31,823 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:32,034 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:32,035 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:32,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 144867641, now seen corresponding path program 5 times [2020-07-17 22:50:32,036 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:32,037 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570480974] [2020-07-17 22:50:32,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:32,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,167 INFO L280 TraceCheckUtils]: 0: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-17 22:50:32,167 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-17 22:50:32,168 INFO L263 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1645#true} is VALID [2020-07-17 22:50:32,168 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-17 22:50:32,168 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-17 22:50:32,168 INFO L263 TraceCheckUtils]: 3: Hoare triple {1645#true} call #t~ret2 := main(); {1645#true} is VALID [2020-07-17 22:50:32,169 INFO L280 TraceCheckUtils]: 4: Hoare triple {1645#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,171 INFO L280 TraceCheckUtils]: 5: Hoare triple {1649#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,172 INFO L280 TraceCheckUtils]: 6: Hoare triple {1649#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,173 INFO L280 TraceCheckUtils]: 7: Hoare triple {1649#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,173 INFO L280 TraceCheckUtils]: 8: Hoare triple {1650#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,174 INFO L280 TraceCheckUtils]: 9: Hoare triple {1650#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,175 INFO L280 TraceCheckUtils]: 10: Hoare triple {1650#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,175 INFO L280 TraceCheckUtils]: 11: Hoare triple {1651#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,176 INFO L280 TraceCheckUtils]: 12: Hoare triple {1651#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,177 INFO L280 TraceCheckUtils]: 13: Hoare triple {1651#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,177 INFO L280 TraceCheckUtils]: 14: Hoare triple {1652#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,178 INFO L280 TraceCheckUtils]: 15: Hoare triple {1652#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,179 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,180 INFO L280 TraceCheckUtils]: 17: Hoare triple {1653#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,180 INFO L280 TraceCheckUtils]: 18: Hoare triple {1653#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,181 INFO L280 TraceCheckUtils]: 19: Hoare triple {1653#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,182 INFO L280 TraceCheckUtils]: 20: Hoare triple {1654#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,182 INFO L280 TraceCheckUtils]: 21: Hoare triple {1654#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,183 INFO L280 TraceCheckUtils]: 22: Hoare triple {1654#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,184 INFO L280 TraceCheckUtils]: 23: Hoare triple {1655#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,184 INFO L280 TraceCheckUtils]: 24: Hoare triple {1655#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,185 INFO L280 TraceCheckUtils]: 25: Hoare triple {1655#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1656#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:32,186 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1656#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:32,186 INFO L280 TraceCheckUtils]: 27: Hoare triple {1656#(<= main_~i~0 8)} assume !(~i~0 < 10); {1646#false} is VALID [2020-07-17 22:50:32,186 INFO L280 TraceCheckUtils]: 28: Hoare triple {1646#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1646#false} is VALID [2020-07-17 22:50:32,187 INFO L280 TraceCheckUtils]: 29: Hoare triple {1646#false} assume !(~i~0 <= ~n~0); {1646#false} is VALID [2020-07-17 22:50:32,187 INFO L263 TraceCheckUtils]: 30: Hoare triple {1646#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1646#false} is VALID [2020-07-17 22:50:32,187 INFO L280 TraceCheckUtils]: 31: Hoare triple {1646#false} ~cond := #in~cond; {1646#false} is VALID [2020-07-17 22:50:32,187 INFO L280 TraceCheckUtils]: 32: Hoare triple {1646#false} assume 0 == ~cond; {1646#false} is VALID [2020-07-17 22:50:32,187 INFO L280 TraceCheckUtils]: 33: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2020-07-17 22:50:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:32,189 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570480974] [2020-07-17 22:50:32,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594750484] [2020-07-17 22:50:32,190 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 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:32,218 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2020-07-17 22:50:32,218 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:32,219 INFO L264 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-17 22:50:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:32,229 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:32,307 INFO L263 TraceCheckUtils]: 0: Hoare triple {1645#true} call ULTIMATE.init(); {1645#true} is VALID [2020-07-17 22:50:32,308 INFO L280 TraceCheckUtils]: 1: Hoare triple {1645#true} assume true; {1645#true} is VALID [2020-07-17 22:50:32,308 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1645#true} {1645#true} #37#return; {1645#true} is VALID [2020-07-17 22:50:32,308 INFO L263 TraceCheckUtils]: 3: Hoare triple {1645#true} call #t~ret2 := main(); {1645#true} is VALID [2020-07-17 22:50:32,309 INFO L280 TraceCheckUtils]: 4: Hoare triple {1645#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,310 INFO L280 TraceCheckUtils]: 5: Hoare triple {1649#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,310 INFO L280 TraceCheckUtils]: 6: Hoare triple {1649#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1649#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:32,312 INFO L280 TraceCheckUtils]: 7: Hoare triple {1649#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,312 INFO L280 TraceCheckUtils]: 8: Hoare triple {1650#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,313 INFO L280 TraceCheckUtils]: 9: Hoare triple {1650#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1650#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:32,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {1650#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,315 INFO L280 TraceCheckUtils]: 11: Hoare triple {1651#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {1651#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1651#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:32,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {1651#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,316 INFO L280 TraceCheckUtils]: 14: Hoare triple {1652#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {1652#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1652#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:32,318 INFO L280 TraceCheckUtils]: 16: Hoare triple {1652#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,324 INFO L280 TraceCheckUtils]: 17: Hoare triple {1653#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,328 INFO L280 TraceCheckUtils]: 18: Hoare triple {1653#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1653#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:32,329 INFO L280 TraceCheckUtils]: 19: Hoare triple {1653#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,330 INFO L280 TraceCheckUtils]: 20: Hoare triple {1654#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,330 INFO L280 TraceCheckUtils]: 21: Hoare triple {1654#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1654#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:32,331 INFO L280 TraceCheckUtils]: 22: Hoare triple {1654#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,332 INFO L280 TraceCheckUtils]: 23: Hoare triple {1655#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,332 INFO L280 TraceCheckUtils]: 24: Hoare triple {1655#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1655#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:32,335 INFO L280 TraceCheckUtils]: 25: Hoare triple {1655#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1656#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:32,335 INFO L280 TraceCheckUtils]: 26: Hoare triple {1656#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1656#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:32,336 INFO L280 TraceCheckUtils]: 27: Hoare triple {1656#(<= main_~i~0 8)} assume !(~i~0 < 10); {1646#false} is VALID [2020-07-17 22:50:32,336 INFO L280 TraceCheckUtils]: 28: Hoare triple {1646#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1646#false} is VALID [2020-07-17 22:50:32,336 INFO L280 TraceCheckUtils]: 29: Hoare triple {1646#false} assume !(~i~0 <= ~n~0); {1646#false} is VALID [2020-07-17 22:50:32,336 INFO L263 TraceCheckUtils]: 30: Hoare triple {1646#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1646#false} is VALID [2020-07-17 22:50:32,337 INFO L280 TraceCheckUtils]: 31: Hoare triple {1646#false} ~cond := #in~cond; {1646#false} is VALID [2020-07-17 22:50:32,337 INFO L280 TraceCheckUtils]: 32: Hoare triple {1646#false} assume 0 == ~cond; {1646#false} is VALID [2020-07-17 22:50:32,337 INFO L280 TraceCheckUtils]: 33: Hoare triple {1646#false} assume !false; {1646#false} is VALID [2020-07-17 22:50:32,338 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 15 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:32,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:32,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 10 [2020-07-17 22:50:32,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266120861] [2020-07-17 22:50:32,342 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-17 22:50:32,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:32,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:50:32,383 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:32,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:50:32,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:32,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:50:32,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:32,384 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand 10 states. [2020-07-17 22:50:32,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:32,556 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2020-07-17 22:50:32,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:50:32,556 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 34 [2020-07-17 22:50:32,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:32,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:32,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-17 22:50:32,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:50:32,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 48 transitions. [2020-07-17 22:50:32,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 48 transitions. [2020-07-17 22:50:32,617 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:32,619 INFO L225 Difference]: With dead ends: 48 [2020-07-17 22:50:32,619 INFO L226 Difference]: Without dead ends: 40 [2020-07-17 22:50:32,620 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:50:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2020-07-17 22:50:32,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2020-07-17 22:50:32,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:32,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand 39 states. [2020-07-17 22:50:32,658 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 39 states. [2020-07-17 22:50:32,658 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 39 states. [2020-07-17 22:50:32,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:32,660 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-17 22:50:32,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-17 22:50:32,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:32,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:32,660 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 40 states. [2020-07-17 22:50:32,661 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 40 states. [2020-07-17 22:50:32,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:32,667 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2020-07-17 22:50:32,667 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2020-07-17 22:50:32,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:32,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:32,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:32,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:32,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-07-17 22:50:32,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2020-07-17 22:50:32,672 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 34 [2020-07-17 22:50:32,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:32,672 INFO L479 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2020-07-17 22:50:32,672 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:50:32,673 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2020-07-17 22:50:32,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2020-07-17 22:50:32,673 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:32,676 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:32,876 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:32,877 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:32,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:32,878 INFO L82 PathProgramCache]: Analyzing trace with hash -232382699, now seen corresponding path program 6 times [2020-07-17 22:50:32,878 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:32,878 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963083534] [2020-07-17 22:50:32,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:32,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:33,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-17 22:50:33,008 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-17 22:50:33,008 INFO L263 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2020-07-17 22:50:33,008 INFO L280 TraceCheckUtils]: 1: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-17 22:50:33,008 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-17 22:50:33,008 INFO L263 TraceCheckUtils]: 3: Hoare triple {1960#true} call #t~ret2 := main(); {1960#true} is VALID [2020-07-17 22:50:33,012 INFO L280 TraceCheckUtils]: 4: Hoare triple {1960#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,012 INFO L280 TraceCheckUtils]: 5: Hoare triple {1964#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,015 INFO L280 TraceCheckUtils]: 6: Hoare triple {1964#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,016 INFO L280 TraceCheckUtils]: 7: Hoare triple {1964#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,016 INFO L280 TraceCheckUtils]: 8: Hoare triple {1965#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,017 INFO L280 TraceCheckUtils]: 9: Hoare triple {1965#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,018 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,018 INFO L280 TraceCheckUtils]: 11: Hoare triple {1966#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,019 INFO L280 TraceCheckUtils]: 12: Hoare triple {1966#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,020 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,020 INFO L280 TraceCheckUtils]: 14: Hoare triple {1967#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,021 INFO L280 TraceCheckUtils]: 15: Hoare triple {1967#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,021 INFO L280 TraceCheckUtils]: 16: Hoare triple {1967#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,022 INFO L280 TraceCheckUtils]: 17: Hoare triple {1968#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,022 INFO L280 TraceCheckUtils]: 18: Hoare triple {1968#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,023 INFO L280 TraceCheckUtils]: 19: Hoare triple {1968#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,023 INFO L280 TraceCheckUtils]: 20: Hoare triple {1969#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,023 INFO L280 TraceCheckUtils]: 21: Hoare triple {1969#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,024 INFO L280 TraceCheckUtils]: 22: Hoare triple {1969#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,024 INFO L280 TraceCheckUtils]: 23: Hoare triple {1970#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,025 INFO L280 TraceCheckUtils]: 24: Hoare triple {1970#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,025 INFO L280 TraceCheckUtils]: 25: Hoare triple {1970#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,026 INFO L280 TraceCheckUtils]: 26: Hoare triple {1971#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,026 INFO L280 TraceCheckUtils]: 27: Hoare triple {1971#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,027 INFO L280 TraceCheckUtils]: 28: Hoare triple {1971#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1972#(<= main_~i~0 9)} is VALID [2020-07-17 22:50:33,029 INFO L280 TraceCheckUtils]: 29: Hoare triple {1972#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1972#(<= main_~i~0 9)} is VALID [2020-07-17 22:50:33,031 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#(<= main_~i~0 9)} assume !(~i~0 < 10); {1961#false} is VALID [2020-07-17 22:50:33,031 INFO L280 TraceCheckUtils]: 31: Hoare triple {1961#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1961#false} is VALID [2020-07-17 22:50:33,031 INFO L280 TraceCheckUtils]: 32: Hoare triple {1961#false} assume !(~i~0 <= ~n~0); {1961#false} is VALID [2020-07-17 22:50:33,032 INFO L263 TraceCheckUtils]: 33: Hoare triple {1961#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1961#false} is VALID [2020-07-17 22:50:33,032 INFO L280 TraceCheckUtils]: 34: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2020-07-17 22:50:33,032 INFO L280 TraceCheckUtils]: 35: Hoare triple {1961#false} assume 0 == ~cond; {1961#false} is VALID [2020-07-17 22:50:33,032 INFO L280 TraceCheckUtils]: 36: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2020-07-17 22:50:33,034 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:33,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963083534] [2020-07-17 22:50:33,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257448010] [2020-07-17 22:50:33,034 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:50:33,074 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2020-07-17 22:50:33,074 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:50:33,075 INFO L264 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:50:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:50:33,086 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:50:33,180 INFO L263 TraceCheckUtils]: 0: Hoare triple {1960#true} call ULTIMATE.init(); {1960#true} is VALID [2020-07-17 22:50:33,181 INFO L280 TraceCheckUtils]: 1: Hoare triple {1960#true} assume true; {1960#true} is VALID [2020-07-17 22:50:33,181 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1960#true} {1960#true} #37#return; {1960#true} is VALID [2020-07-17 22:50:33,181 INFO L263 TraceCheckUtils]: 3: Hoare triple {1960#true} call #t~ret2 := main(); {1960#true} is VALID [2020-07-17 22:50:33,182 INFO L280 TraceCheckUtils]: 4: Hoare triple {1960#true} havoc ~i~0;~n~0 := (if #t~nondet0 % 4294967296 % 4294967296 <= 2147483647 then #t~nondet0 % 4294967296 % 4294967296 else #t~nondet0 % 4294967296 % 4294967296 - 4294967296);havoc #t~nondet0;~sn~0 := 0;~i~0 := 1; {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,183 INFO L280 TraceCheckUtils]: 5: Hoare triple {1964#(<= main_~i~0 1)} assume !!(~i~0 <= ~n~0); {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,183 INFO L280 TraceCheckUtils]: 6: Hoare triple {1964#(<= main_~i~0 1)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1964#(<= main_~i~0 1)} is VALID [2020-07-17 22:50:33,188 INFO L280 TraceCheckUtils]: 7: Hoare triple {1964#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,188 INFO L280 TraceCheckUtils]: 8: Hoare triple {1965#(<= main_~i~0 2)} assume !!(~i~0 <= ~n~0); {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,189 INFO L280 TraceCheckUtils]: 9: Hoare triple {1965#(<= main_~i~0 2)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1965#(<= main_~i~0 2)} is VALID [2020-07-17 22:50:33,189 INFO L280 TraceCheckUtils]: 10: Hoare triple {1965#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,190 INFO L280 TraceCheckUtils]: 11: Hoare triple {1966#(<= main_~i~0 3)} assume !!(~i~0 <= ~n~0); {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,190 INFO L280 TraceCheckUtils]: 12: Hoare triple {1966#(<= main_~i~0 3)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1966#(<= main_~i~0 3)} is VALID [2020-07-17 22:50:33,191 INFO L280 TraceCheckUtils]: 13: Hoare triple {1966#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,191 INFO L280 TraceCheckUtils]: 14: Hoare triple {1967#(<= main_~i~0 4)} assume !!(~i~0 <= ~n~0); {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,192 INFO L280 TraceCheckUtils]: 15: Hoare triple {1967#(<= main_~i~0 4)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1967#(<= main_~i~0 4)} is VALID [2020-07-17 22:50:33,193 INFO L280 TraceCheckUtils]: 16: Hoare triple {1967#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,193 INFO L280 TraceCheckUtils]: 17: Hoare triple {1968#(<= main_~i~0 5)} assume !!(~i~0 <= ~n~0); {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,194 INFO L280 TraceCheckUtils]: 18: Hoare triple {1968#(<= main_~i~0 5)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1968#(<= main_~i~0 5)} is VALID [2020-07-17 22:50:33,194 INFO L280 TraceCheckUtils]: 19: Hoare triple {1968#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,195 INFO L280 TraceCheckUtils]: 20: Hoare triple {1969#(<= main_~i~0 6)} assume !!(~i~0 <= ~n~0); {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,195 INFO L280 TraceCheckUtils]: 21: Hoare triple {1969#(<= main_~i~0 6)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1969#(<= main_~i~0 6)} is VALID [2020-07-17 22:50:33,196 INFO L280 TraceCheckUtils]: 22: Hoare triple {1969#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,196 INFO L280 TraceCheckUtils]: 23: Hoare triple {1970#(<= main_~i~0 7)} assume !!(~i~0 <= ~n~0); {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,197 INFO L280 TraceCheckUtils]: 24: Hoare triple {1970#(<= main_~i~0 7)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1970#(<= main_~i~0 7)} is VALID [2020-07-17 22:50:33,198 INFO L280 TraceCheckUtils]: 25: Hoare triple {1970#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,198 INFO L280 TraceCheckUtils]: 26: Hoare triple {1971#(<= main_~i~0 8)} assume !!(~i~0 <= ~n~0); {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,199 INFO L280 TraceCheckUtils]: 27: Hoare triple {1971#(<= main_~i~0 8)} assume ~i~0 < 10;~sn~0 := 2 + ~sn~0; {1971#(<= main_~i~0 8)} is VALID [2020-07-17 22:50:33,199 INFO L280 TraceCheckUtils]: 28: Hoare triple {1971#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1972#(<= main_~i~0 9)} is VALID [2020-07-17 22:50:33,200 INFO L280 TraceCheckUtils]: 29: Hoare triple {1972#(<= main_~i~0 9)} assume !!(~i~0 <= ~n~0); {1972#(<= main_~i~0 9)} is VALID [2020-07-17 22:50:33,200 INFO L280 TraceCheckUtils]: 30: Hoare triple {1972#(<= main_~i~0 9)} assume !(~i~0 < 10); {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L280 TraceCheckUtils]: 31: Hoare triple {1961#false} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L280 TraceCheckUtils]: 32: Hoare triple {1961#false} assume !(~i~0 <= ~n~0); {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L263 TraceCheckUtils]: 33: Hoare triple {1961#false} call __VERIFIER_assert((if ~sn~0 == 2 * ~n~0 || 0 == ~sn~0 then 1 else 0)); {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L280 TraceCheckUtils]: 34: Hoare triple {1961#false} ~cond := #in~cond; {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L280 TraceCheckUtils]: 35: Hoare triple {1961#false} assume 0 == ~cond; {1961#false} is VALID [2020-07-17 22:50:33,201 INFO L280 TraceCheckUtils]: 36: Hoare triple {1961#false} assume !false; {1961#false} is VALID [2020-07-17 22:50:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 17 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:50:33,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:50:33,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 11 [2020-07-17 22:50:33,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847413934] [2020-07-17 22:50:33,204 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:50:33,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:50:33,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states. [2020-07-17 22:50:33,238 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-17 22:50:33,238 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-07-17 22:50:33,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:50:33,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-07-17 22:50:33,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:33,239 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 11 states. [2020-07-17 22:50:33,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,395 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2020-07-17 22:50:33,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:50:33,395 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2020-07-17 22:50:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:50:33,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:33,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-17 22:50:33,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-17 22:50:33,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 51 transitions. [2020-07-17 22:50:33,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 51 transitions. [2020-07-17 22:50:33,461 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:50:33,462 INFO L225 Difference]: With dead ends: 51 [2020-07-17 22:50:33,462 INFO L226 Difference]: Without dead ends: 43 [2020-07-17 22:50:33,463 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2020-07-17 22:50:33,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-17 22:50:33,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-17 22:50:33,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:50:33,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-17 22:50:33,491 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-17 22:50:33,491 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-17 22:50:33,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,493 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-17 22:50:33,493 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-17 22:50:33,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:33,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:33,493 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-17 22:50:33,494 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-17 22:50:33,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:50:33,495 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2020-07-17 22:50:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2020-07-17 22:50:33,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:50:33,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:50:33,496 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:50:33,496 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:50:33,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-17 22:50:33,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2020-07-17 22:50:33,497 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 37 [2020-07-17 22:50:33,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:50:33,498 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2020-07-17 22:50:33,498 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-07-17 22:50:33,498 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2020-07-17 22:50:33,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-07-17 22:50:33,498 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:50:33,499 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:50:33,709 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-07-17 22:50:33,710 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:50:33,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:50:33,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1032151993, now seen corresponding path program 7 times [2020-07-17 22:50:33,711 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:50:33,711 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420734333] [2020-07-17 22:50:33,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:50:33,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:33,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-17 22:50:33,777 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-17 22:50:33,777 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-17 22:50:33,778 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-17 22:50:33,806 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:33,807 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L13-3 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L13-4 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:33,808 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:50:33,809 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:50:33,809 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-17 22:50:33,811 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:50:33 BoogieIcfgContainer [2020-07-17 22:50:33,812 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:50:33,815 INFO L168 Benchmark]: Toolchain (without parser) took 10210.99 ms. Allocated memory was 136.8 MB in the beginning and 318.2 MB in the end (delta: 181.4 MB). Free memory was 101.8 MB in the beginning and 270.0 MB in the end (delta: -168.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,815 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.54 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 91.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,816 INFO L168 Benchmark]: Boogie Preprocessor took 111.44 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 180.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,817 INFO L168 Benchmark]: RCFGBuilder took 366.27 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 163.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,818 INFO L168 Benchmark]: TraceAbstraction took 9444.62 ms. Allocated memory was 200.8 MB in the beginning and 318.2 MB in the end (delta: 117.4 MB). Free memory was 163.2 MB in the beginning and 270.0 MB in the end (delta: -106.8 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2020-07-17 22:50:33,820 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.26 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.54 ms. Allocated memory is still 136.8 MB. Free memory was 101.3 MB in the beginning and 91.8 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 111.44 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.8 MB in the beginning and 180.0 MB in the end (delta: -88.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 366.27 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 163.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9444.62 ms. Allocated memory was 200.8 MB in the beginning and 318.2 MB in the end (delta: 117.4 MB). Free memory was 163.2 MB in the beginning and 270.0 MB in the end (delta: -106.8 MB). Peak memory consumption was 10.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, n=__VERIFIER_nondet_uint(), sn=0; [L12] int i, n=__VERIFIER_nondet_uint(), sn=0; [L13] i=1 VAL [i=1, n=0, n=10] [L13] COND TRUE i<=n VAL [i=1, n=10, n=0] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=1, n=2, n=10] [L13] i++ VAL [i=2, n=10, n=2] [L13] COND TRUE i<=n VAL [i=2, n=2, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=2, n=4, n=10] [L13] i++ VAL [i=3, n=4, n=10] [L13] COND TRUE i<=n VAL [i=3, n=10, n=4] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=3, n=6, n=10] [L13] i++ VAL [i=4, n=10, n=6] [L13] COND TRUE i<=n VAL [i=4, n=10, n=6] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=4, n=10, n=8] [L13] i++ VAL [i=5, n=10, n=8] [L13] COND TRUE i<=n VAL [i=5, n=10, n=8] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=5, n=10, n=10] [L13] i++ VAL [i=6, n=10, n=10] [L13] COND TRUE i<=n VAL [i=6, n=10, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=6, n=12, n=10] [L13] i++ VAL [i=7, n=10, n=12] [L13] COND TRUE i<=n VAL [i=7, n=12, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=7, n=10, n=14] [L13] i++ VAL [i=8, n=14, n=10] [L13] COND TRUE i<=n VAL [i=8, n=10, n=14] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=8, n=10, n=16] [L13] i++ VAL [i=9, n=16, n=10] [L13] COND TRUE i<=n VAL [i=9, n=16, n=10] [L14] COND TRUE i<10 [L15] sn = sn + (2) VAL [i=9, n=18, n=10] [L13] i++ VAL [i=10, n=18, n=10] [L13] COND TRUE i<=n VAL [i=10, n=18, n=10] [L14] COND FALSE !(i<10) VAL [i=10, n=10, n=18] [L13] i++ VAL [i=11, n=10, n=18] [L13] COND FALSE !(i<=n) VAL [i=11, n=10, n=18] [L17] CALL __VERIFIER_assert(sn==n*(2) || sn == 0) VAL [\old(cond)=0] [L4] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L5] __VERIFIER_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 19 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.3s, OverallIterations: 11, TraceHistogramMax: 10, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 114 SDtfs, 61 SDslu, 464 SDs, 0 SdLazy, 536 SolverSat, 28 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 316 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 10 MinimizatonAttempts, 9 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 414 ConstructedInterpolants, 0 QuantifiedInterpolants, 29688 SizeOfPredicates, 12 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 18 InterpolantComputations, 2 PerfectInterpolantSequences, 145/780 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...