/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/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/loop-lit/gsv2008.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 20:24:49,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 20:24:49,809 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 20:24:49,823 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 20:24:49,823 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 20:24:49,825 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 20:24:49,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 20:24:49,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 20:24:49,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 20:24:49,830 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 20:24:49,831 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 20:24:49,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 20:24:49,833 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 20:24:49,834 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 20:24:49,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 20:24:49,836 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 20:24:49,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 20:24:49,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 20:24:49,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 20:24:49,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 20:24:49,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 20:24:49,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 20:24:49,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 20:24:49,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 20:24:49,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 20:24:49,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 20:24:49,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 20:24:49,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 20:24:49,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 20:24:49,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 20:24:49,852 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 20:24:49,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 20:24:49,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 20:24:49,854 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 20:24:49,855 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 20:24:49,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 20:24:49,856 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 20:24:49,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 20:24:49,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 20:24:49,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 20:24:49,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 20:24:49,859 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-07-10 20:24:49,868 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 20:24:49,868 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 20:24:49,870 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 20:24:49,870 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 20:24:49,870 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 20:24:49,870 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 20:24:49,870 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 20:24:49,871 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 20:24:49,871 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 20:24:49,871 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 20:24:49,871 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 20:24:49,871 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 20:24:49,872 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 20:24:49,872 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 20:24:49,872 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 20:24:49,872 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-07-10 20:24:49,872 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 20:24:49,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 20:24:49,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 20:24:49,873 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 20:24:49,873 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-07-10 20:24:49,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 20:24:49,873 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2020-07-10 20:24:50,162 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 20:24:50,177 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 20:24:50,181 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 20:24:50,182 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 20:24:50,183 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 20:24:50,183 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.i [2020-07-10 20:24:50,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a041672/ea05c470a17e4c0792c5b5e73676ce83/FLAG70a7ae391 [2020-07-10 20:24:50,744 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 20:24:50,746 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.i [2020-07-10 20:24:50,753 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a041672/ea05c470a17e4c0792c5b5e73676ce83/FLAG70a7ae391 [2020-07-10 20:24:51,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9a041672/ea05c470a17e4c0792c5b5e73676ce83 [2020-07-10 20:24:51,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 20:24:51,102 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 20:24:51,103 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:51,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 20:24:51,107 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 20:24:51,108 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7227971a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51, skipping insertion in model container [2020-07-10 20:24:51,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 20:24:51,142 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 20:24:51,335 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:51,340 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 20:24:51,357 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 20:24:51,372 INFO L208 MainTranslator]: Completed translation [2020-07-10 20:24:51,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51 WrapperNode [2020-07-10 20:24:51,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 20:24:51,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 20:24:51,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 20:24:51,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 20:24:51,388 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,388 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,399 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,405 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,406 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (1/1) ... [2020-07-10 20:24:51,407 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 20:24:51,408 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 20:24:51,408 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 20:24:51,408 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 20:24:51,409 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (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-10 20:24:51,552 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 20:24:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 20:24:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-10 20:24:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-10 20:24:51,553 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 20:24:51,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 20:24:51,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 20:24:51,827 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 20:24:51,828 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-10 20:24:51,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:51 BoogieIcfgContainer [2020-07-10 20:24:51,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 20:24:51,834 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 20:24:51,834 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 20:24:51,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 20:24:51,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 08:24:51" (1/3) ... [2020-07-10 20:24:51,838 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ef51ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:51, skipping insertion in model container [2020-07-10 20:24:51,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 08:24:51" (2/3) ... [2020-07-10 20:24:51,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38ef51ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 08:24:51, skipping insertion in model container [2020-07-10 20:24:51,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 08:24:51" (3/3) ... [2020-07-10 20:24:51,842 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.i [2020-07-10 20:24:51,857 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-07-10 20:24:51,864 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 20:24:51,882 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 20:24:51,909 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 20:24:51,909 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 20:24:51,909 INFO L377 AbstractCegarLoop]: Compute interpolants for AcceleratedInterpolation [2020-07-10 20:24:51,910 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 20:24:51,910 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 20:24:51,910 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 20:24:51,910 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 20:24:51,910 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 20:24:51,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-10 20:24:51,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 20:24:51,939 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:51,940 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:51,941 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:51,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:51,948 INFO L82 PathProgramCache]: Analyzing trace with hash 2104509233, now seen corresponding path program 1 times [2020-07-10 20:24:51,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:51,959 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [546790535] [2020-07-10 20:24:51,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:52,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,126 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 20:24:52,126 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {32#true} {32#true} #55#return; {32#true} is VALID [2020-07-10 20:24:52,129 INFO L263 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {32#true} is VALID [2020-07-10 20:24:52,129 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2020-07-10 20:24:52,129 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #55#return; {32#true} is VALID [2020-07-10 20:24:52,130 INFO L263 TraceCheckUtils]: 3: Hoare triple {32#true} call #t~ret2 := main(); {32#true} is VALID [2020-07-10 20:24:52,130 INFO L280 TraceCheckUtils]: 4: Hoare triple {32#true} havoc ~x~0; {32#true} is VALID [2020-07-10 20:24:52,131 INFO L280 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~y~0; {32#true} is VALID [2020-07-10 20:24:52,131 INFO L280 TraceCheckUtils]: 6: Hoare triple {32#true} ~x~0 := -50; {32#true} is VALID [2020-07-10 20:24:52,131 INFO L280 TraceCheckUtils]: 7: Hoare triple {32#true} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {32#true} is VALID [2020-07-10 20:24:52,132 INFO L280 TraceCheckUtils]: 8: Hoare triple {32#true} ~y~0 := #t~nondet0; {32#true} is VALID [2020-07-10 20:24:52,132 INFO L280 TraceCheckUtils]: 9: Hoare triple {32#true} havoc #t~nondet0; {32#true} is VALID [2020-07-10 20:24:52,133 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#true} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {32#true} is VALID [2020-07-10 20:24:52,150 INFO L280 TraceCheckUtils]: 11: Hoare triple {32#true} assume !true; {33#false} is VALID [2020-07-10 20:24:52,150 INFO L263 TraceCheckUtils]: 12: Hoare triple {33#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {33#false} is VALID [2020-07-10 20:24:52,151 INFO L280 TraceCheckUtils]: 13: Hoare triple {33#false} ~cond := #in~cond; {33#false} is VALID [2020-07-10 20:24:52,151 INFO L280 TraceCheckUtils]: 14: Hoare triple {33#false} assume 0 == ~cond; {33#false} is VALID [2020-07-10 20:24:52,151 INFO L280 TraceCheckUtils]: 15: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-10 20:24:52,153 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-10 20:24:52,153 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:52,155 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [546790535] [2020-07-10 20:24:52,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:52,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-10 20:24:52,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549511496] [2020-07-10 20:24:52,167 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-10 20:24:52,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:52,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-10 20:24:52,219 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:52,219 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-10 20:24:52,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:52,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-10 20:24:52,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-10 20:24:52,235 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2020-07-10 20:24:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,333 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2020-07-10 20:24:52,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-10 20:24:52,333 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2020-07-10 20:24:52,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:52,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:52,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 20:24:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-10 20:24:52,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-10 20:24:52,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-10 20:24:52,435 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-10 20:24:52,446 INFO L225 Difference]: With dead ends: 41 [2020-07-10 20:24:52,446 INFO L226 Difference]: Without dead ends: 21 [2020-07-10 20:24:52,451 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-10 20:24:52,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2020-07-10 20:24:52,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-07-10 20:24:52,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:52,505 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states. [2020-07-10 20:24:52,505 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 20:24:52,506 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 20:24:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,510 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 20:24:52,510 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 20:24:52,511 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,511 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,512 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states. [2020-07-10 20:24:52,512 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states. [2020-07-10 20:24:52,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,516 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2020-07-10 20:24:52,516 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 20:24:52,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:52,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:52,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:24:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2020-07-10 20:24:52,523 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2020-07-10 20:24:52,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:52,523 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2020-07-10 20:24:52,524 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-10 20:24:52,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states and 21 transitions. [2020-07-10 20:24:52,555 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-10 20:24:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2020-07-10 20:24:52,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-07-10 20:24:52,556 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:52,557 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:52,557 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 20:24:52,557 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:52,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:52,558 INFO L82 PathProgramCache]: Analyzing trace with hash 2097121065, now seen corresponding path program 1 times [2020-07-10 20:24:52,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:52,559 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2126192685] [2020-07-10 20:24:52,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:52,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:52,618 INFO L280 TraceCheckUtils]: 0: Hoare triple {204#true} assume true; {204#true} is VALID [2020-07-10 20:24:52,619 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {204#true} {204#true} #55#return; {204#true} is VALID [2020-07-10 20:24:52,619 INFO L263 TraceCheckUtils]: 0: Hoare triple {204#true} call ULTIMATE.init(); {204#true} is VALID [2020-07-10 20:24:52,619 INFO L280 TraceCheckUtils]: 1: Hoare triple {204#true} assume true; {204#true} is VALID [2020-07-10 20:24:52,620 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {204#true} {204#true} #55#return; {204#true} is VALID [2020-07-10 20:24:52,620 INFO L263 TraceCheckUtils]: 3: Hoare triple {204#true} call #t~ret2 := main(); {204#true} is VALID [2020-07-10 20:24:52,620 INFO L280 TraceCheckUtils]: 4: Hoare triple {204#true} havoc ~x~0; {204#true} is VALID [2020-07-10 20:24:52,621 INFO L280 TraceCheckUtils]: 5: Hoare triple {204#true} havoc ~y~0; {204#true} is VALID [2020-07-10 20:24:52,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {204#true} ~x~0 := -50; {208#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:52,623 INFO L280 TraceCheckUtils]: 7: Hoare triple {208#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {208#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:52,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {208#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {208#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:52,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {208#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {208#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:52,626 INFO L280 TraceCheckUtils]: 10: Hoare triple {208#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {208#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:52,627 INFO L280 TraceCheckUtils]: 11: Hoare triple {208#(<= (+ main_~x~0 50) 0)} assume !(~x~0 < 0); {205#false} is VALID [2020-07-10 20:24:52,628 INFO L263 TraceCheckUtils]: 12: Hoare triple {205#false} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {205#false} is VALID [2020-07-10 20:24:52,628 INFO L280 TraceCheckUtils]: 13: Hoare triple {205#false} ~cond := #in~cond; {205#false} is VALID [2020-07-10 20:24:52,628 INFO L280 TraceCheckUtils]: 14: Hoare triple {205#false} assume 0 == ~cond; {205#false} is VALID [2020-07-10 20:24:52,629 INFO L280 TraceCheckUtils]: 15: Hoare triple {205#false} assume !false; {205#false} is VALID [2020-07-10 20:24:52,631 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-10 20:24:52,631 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:52,632 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2126192685] [2020-07-10 20:24:52,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:52,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-10 20:24:52,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160243834] [2020-07-10 20:24:52,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 20:24:52,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:52,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-10 20:24:52,658 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:52,658 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-10 20:24:52,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:52,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-10 20:24:52,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:24:52,660 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 3 states. [2020-07-10 20:24:52,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,735 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 20:24:52,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-10 20:24:52,736 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2020-07-10 20:24:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:52,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:24:52,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-10 20:24:52,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-10 20:24:52,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-07-10 20:24:52,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 28 transitions. [2020-07-10 20:24:52,784 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-10 20:24:52,785 INFO L225 Difference]: With dead ends: 28 [2020-07-10 20:24:52,786 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 20:24:52,787 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-10 20:24:52,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 20:24:52,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-07-10 20:24:52,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:52,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 22 states. [2020-07-10 20:24:52,829 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 22 states. [2020-07-10 20:24:52,829 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 22 states. [2020-07-10 20:24:52,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,831 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 20:24:52,831 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 20:24:52,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,832 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 23 states. [2020-07-10 20:24:52,832 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 23 states. [2020-07-10 20:24:52,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:52,835 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2020-07-10 20:24:52,835 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2020-07-10 20:24:52,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:52,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:52,836 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:52,836 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:52,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-10 20:24:52,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2020-07-10 20:24:52,839 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 16 [2020-07-10 20:24:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:52,839 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2020-07-10 20:24:52,839 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-10 20:24:52,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2020-07-10 20:24:52,868 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2020-07-10 20:24:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-07-10 20:24:52,869 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:52,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:52,870 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 20:24:52,870 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash -588245929, now seen corresponding path program 1 times [2020-07-10 20:24:52,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:52,871 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [316918858] [2020-07-10 20:24:52,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:52,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,072 INFO L280 TraceCheckUtils]: 0: Hoare triple {357#true} assume true; {357#true} is VALID [2020-07-10 20:24:53,073 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {357#true} {357#true} #55#return; {357#true} is VALID [2020-07-10 20:24:53,073 INFO L263 TraceCheckUtils]: 0: Hoare triple {357#true} call ULTIMATE.init(); {357#true} is VALID [2020-07-10 20:24:53,074 INFO L280 TraceCheckUtils]: 1: Hoare triple {357#true} assume true; {357#true} is VALID [2020-07-10 20:24:53,074 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {357#true} {357#true} #55#return; {357#true} is VALID [2020-07-10 20:24:53,074 INFO L263 TraceCheckUtils]: 3: Hoare triple {357#true} call #t~ret2 := main(); {357#true} is VALID [2020-07-10 20:24:53,075 INFO L280 TraceCheckUtils]: 4: Hoare triple {357#true} havoc ~x~0; {357#true} is VALID [2020-07-10 20:24:53,075 INFO L280 TraceCheckUtils]: 5: Hoare triple {357#true} havoc ~y~0; {357#true} is VALID [2020-07-10 20:24:53,076 INFO L280 TraceCheckUtils]: 6: Hoare triple {357#true} ~x~0 := -50; {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,077 INFO L280 TraceCheckUtils]: 7: Hoare triple {361#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,078 INFO L280 TraceCheckUtils]: 8: Hoare triple {361#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,078 INFO L280 TraceCheckUtils]: 9: Hoare triple {361#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,079 INFO L280 TraceCheckUtils]: 10: Hoare triple {361#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,080 INFO L280 TraceCheckUtils]: 11: Hoare triple {361#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {361#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,081 INFO L280 TraceCheckUtils]: 12: Hoare triple {361#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {362#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:24:53,082 INFO L280 TraceCheckUtils]: 13: Hoare triple {362#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {363#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:24:53,084 INFO L280 TraceCheckUtils]: 14: Hoare triple {363#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {364#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:53,085 INFO L280 TraceCheckUtils]: 15: Hoare triple {364#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {364#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:53,086 INFO L280 TraceCheckUtils]: 16: Hoare triple {364#(<= (+ main_~x~0 51) main_~y~0)} assume !(~x~0 < 0); {365#(<= 51 main_~y~0)} is VALID [2020-07-10 20:24:53,087 INFO L263 TraceCheckUtils]: 17: Hoare triple {365#(<= 51 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {366#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:53,088 INFO L280 TraceCheckUtils]: 18: Hoare triple {366#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {367#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:53,089 INFO L280 TraceCheckUtils]: 19: Hoare triple {367#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {358#false} is VALID [2020-07-10 20:24:53,090 INFO L280 TraceCheckUtils]: 20: Hoare triple {358#false} assume !false; {358#false} is VALID [2020-07-10 20:24:53,092 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-10 20:24:53,092 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:53,093 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [316918858] [2020-07-10 20:24:53,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:53,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-07-10 20:24:53,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581173623] [2020-07-10 20:24:53,094 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-10 20:24:53,094 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:53,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-10 20:24:53,122 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-10 20:24:53,122 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-10 20:24:53,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:53,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-10 20:24:53,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2020-07-10 20:24:53,124 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 9 states. [2020-07-10 20:24:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,428 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-07-10 20:24:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-10 20:24:53,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 21 [2020-07-10 20:24:53,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:53,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:53,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-10 20:24:53,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-10 20:24:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 33 transitions. [2020-07-10 20:24:53,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 33 transitions. [2020-07-10 20:24:53,474 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-10 20:24:53,476 INFO L225 Difference]: With dead ends: 33 [2020-07-10 20:24:53,476 INFO L226 Difference]: Without dead ends: 28 [2020-07-10 20:24:53,477 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2020-07-10 20:24:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-10 20:24:53,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2020-07-10 20:24:53,501 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:53,501 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 27 states. [2020-07-10 20:24:53,501 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 27 states. [2020-07-10 20:24:53,502 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 27 states. [2020-07-10 20:24:53,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,504 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 20:24:53,505 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 20:24:53,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:53,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:53,505 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 28 states. [2020-07-10 20:24:53,506 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 28 states. [2020-07-10 20:24:53,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:53,508 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2020-07-10 20:24:53,509 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2020-07-10 20:24:53,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:53,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:53,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:53,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:53,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:24:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-10 20:24:53,512 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 21 [2020-07-10 20:24:53,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:53,513 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-10 20:24:53,513 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-10 20:24:53,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 27 transitions. [2020-07-10 20:24:53,549 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:53,550 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-10 20:24:53,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-10 20:24:53,551 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:53,551 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:53,552 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-10 20:24:53,552 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:53,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:53,552 INFO L82 PathProgramCache]: Analyzing trace with hash -590441495, now seen corresponding path program 2 times [2020-07-10 20:24:53,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:53,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2110773742] [2020-07-10 20:24:53,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:53,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:53,773 INFO L280 TraceCheckUtils]: 0: Hoare triple {554#true} assume true; {554#true} is VALID [2020-07-10 20:24:53,774 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {554#true} {554#true} #55#return; {554#true} is VALID [2020-07-10 20:24:53,774 INFO L263 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2020-07-10 20:24:53,775 INFO L280 TraceCheckUtils]: 1: Hoare triple {554#true} assume true; {554#true} is VALID [2020-07-10 20:24:53,775 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {554#true} {554#true} #55#return; {554#true} is VALID [2020-07-10 20:24:53,776 INFO L263 TraceCheckUtils]: 3: Hoare triple {554#true} call #t~ret2 := main(); {554#true} is VALID [2020-07-10 20:24:53,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {554#true} havoc ~x~0; {554#true} is VALID [2020-07-10 20:24:53,776 INFO L280 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~y~0; {554#true} is VALID [2020-07-10 20:24:53,777 INFO L280 TraceCheckUtils]: 6: Hoare triple {554#true} ~x~0 := -50; {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,778 INFO L280 TraceCheckUtils]: 7: Hoare triple {558#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,779 INFO L280 TraceCheckUtils]: 8: Hoare triple {558#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,781 INFO L280 TraceCheckUtils]: 9: Hoare triple {558#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,782 INFO L280 TraceCheckUtils]: 10: Hoare triple {558#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,783 INFO L280 TraceCheckUtils]: 11: Hoare triple {558#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {558#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:53,798 INFO L280 TraceCheckUtils]: 12: Hoare triple {558#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {559#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:24:53,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {559#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {560#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:24:53,800 INFO L280 TraceCheckUtils]: 14: Hoare triple {560#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {561#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:53,801 INFO L280 TraceCheckUtils]: 15: Hoare triple {561#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {561#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:53,802 INFO L280 TraceCheckUtils]: 16: Hoare triple {561#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {561#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:53,803 INFO L280 TraceCheckUtils]: 17: Hoare triple {561#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {562#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:53,804 INFO L280 TraceCheckUtils]: 18: Hoare triple {562#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {563#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:24:53,805 INFO L280 TraceCheckUtils]: 19: Hoare triple {563#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {564#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:53,806 INFO L280 TraceCheckUtils]: 20: Hoare triple {564#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {564#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:53,807 INFO L280 TraceCheckUtils]: 21: Hoare triple {564#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !(~x~0 < 0); {565#(<= 27 main_~y~0)} is VALID [2020-07-10 20:24:53,809 INFO L263 TraceCheckUtils]: 22: Hoare triple {565#(<= 27 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {566#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:53,810 INFO L280 TraceCheckUtils]: 23: Hoare triple {566#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {567#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:53,811 INFO L280 TraceCheckUtils]: 24: Hoare triple {567#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {555#false} is VALID [2020-07-10 20:24:53,811 INFO L280 TraceCheckUtils]: 25: Hoare triple {555#false} assume !false; {555#false} is VALID [2020-07-10 20:24:53,813 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-10 20:24:53,814 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:53,814 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2110773742] [2020-07-10 20:24:53,815 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:53,815 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-07-10 20:24:53,815 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375250862] [2020-07-10 20:24:53,816 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-07-10 20:24:53,816 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:53,816 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2020-07-10 20:24:53,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:53,849 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-07-10 20:24:53,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:53,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-07-10 20:24:53,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2020-07-10 20:24:53,850 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 12 states. [2020-07-10 20:24:54,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,370 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:24:54,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-07-10 20:24:54,371 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 26 [2020-07-10 20:24:54,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:54,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:54,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2020-07-10 20:24:54,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2020-07-10 20:24:54,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 38 transitions. [2020-07-10 20:24:54,376 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 38 transitions. [2020-07-10 20:24:54,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:54,418 INFO L225 Difference]: With dead ends: 38 [2020-07-10 20:24:54,418 INFO L226 Difference]: Without dead ends: 33 [2020-07-10 20:24:54,419 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:24:54,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-07-10 20:24:54,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-07-10 20:24:54,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:54,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand 32 states. [2020-07-10 20:24:54,456 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand 32 states. [2020-07-10 20:24:54,456 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 32 states. [2020-07-10 20:24:54,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,459 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-07-10 20:24:54,459 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-10 20:24:54,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:54,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:54,460 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand 33 states. [2020-07-10 20:24:54,460 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 33 states. [2020-07-10 20:24:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:54,462 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2020-07-10 20:24:54,462 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2020-07-10 20:24:54,463 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:54,463 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:54,463 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:54,463 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:54,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-07-10 20:24:54,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2020-07-10 20:24:54,465 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 26 [2020-07-10 20:24:54,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:54,466 INFO L479 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2020-07-10 20:24:54,466 INFO L480 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-07-10 20:24:54,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 32 states and 32 transitions. [2020-07-10 20:24:54,500 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:54,500 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2020-07-10 20:24:54,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-10 20:24:54,501 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:54,501 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:54,502 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-10 20:24:54,502 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:54,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:54,502 INFO L82 PathProgramCache]: Analyzing trace with hash -934609001, now seen corresponding path program 3 times [2020-07-10 20:24:54,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:54,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [802682698] [2020-07-10 20:24:54,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:54,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:54,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:54,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {788#true} assume true; {788#true} is VALID [2020-07-10 20:24:54,766 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {788#true} {788#true} #55#return; {788#true} is VALID [2020-07-10 20:24:54,766 INFO L263 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {788#true} is VALID [2020-07-10 20:24:54,766 INFO L280 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2020-07-10 20:24:54,767 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #55#return; {788#true} is VALID [2020-07-10 20:24:54,767 INFO L263 TraceCheckUtils]: 3: Hoare triple {788#true} call #t~ret2 := main(); {788#true} is VALID [2020-07-10 20:24:54,767 INFO L280 TraceCheckUtils]: 4: Hoare triple {788#true} havoc ~x~0; {788#true} is VALID [2020-07-10 20:24:54,767 INFO L280 TraceCheckUtils]: 5: Hoare triple {788#true} havoc ~y~0; {788#true} is VALID [2020-07-10 20:24:54,768 INFO L280 TraceCheckUtils]: 6: Hoare triple {788#true} ~x~0 := -50; {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,769 INFO L280 TraceCheckUtils]: 7: Hoare triple {792#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,769 INFO L280 TraceCheckUtils]: 8: Hoare triple {792#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,770 INFO L280 TraceCheckUtils]: 9: Hoare triple {792#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,770 INFO L280 TraceCheckUtils]: 10: Hoare triple {792#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,770 INFO L280 TraceCheckUtils]: 11: Hoare triple {792#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {792#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:54,776 INFO L280 TraceCheckUtils]: 12: Hoare triple {792#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {793#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:24:54,777 INFO L280 TraceCheckUtils]: 13: Hoare triple {793#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {794#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:24:54,778 INFO L280 TraceCheckUtils]: 14: Hoare triple {794#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {795#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:54,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {795#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {795#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:54,782 INFO L280 TraceCheckUtils]: 16: Hoare triple {795#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {795#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:54,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {795#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {796#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:54,784 INFO L280 TraceCheckUtils]: 18: Hoare triple {796#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {797#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:24:54,784 INFO L280 TraceCheckUtils]: 19: Hoare triple {797#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:54,785 INFO L280 TraceCheckUtils]: 20: Hoare triple {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:54,785 INFO L280 TraceCheckUtils]: 21: Hoare triple {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:54,786 INFO L280 TraceCheckUtils]: 22: Hoare triple {798#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {799#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:54,786 INFO L280 TraceCheckUtils]: 23: Hoare triple {799#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {800#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:24:54,787 INFO L280 TraceCheckUtils]: 24: Hoare triple {800#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {801#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:54,788 INFO L280 TraceCheckUtils]: 25: Hoare triple {801#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {801#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:54,788 INFO L280 TraceCheckUtils]: 26: Hoare triple {801#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !(~x~0 < 0); {802#(<= 19 main_~y~0)} is VALID [2020-07-10 20:24:54,789 INFO L263 TraceCheckUtils]: 27: Hoare triple {802#(<= 19 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {803#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:54,789 INFO L280 TraceCheckUtils]: 28: Hoare triple {803#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {804#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:54,790 INFO L280 TraceCheckUtils]: 29: Hoare triple {804#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {789#false} is VALID [2020-07-10 20:24:54,790 INFO L280 TraceCheckUtils]: 30: Hoare triple {789#false} assume !false; {789#false} is VALID [2020-07-10 20:24:54,792 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-10 20:24:54,792 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:54,793 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [802682698] [2020-07-10 20:24:54,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:54,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-07-10 20:24:54,793 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263756917] [2020-07-10 20:24:54,794 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2020-07-10 20:24:54,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:54,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states. [2020-07-10 20:24:54,838 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-10 20:24:54,838 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-07-10 20:24:54,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:54,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-07-10 20:24:54,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2020-07-10 20:24:54,840 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 15 states. [2020-07-10 20:24:55,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,655 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:24:55,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-07-10 20:24:55,655 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 31 [2020-07-10 20:24:55,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:55,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:24:55,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-10 20:24:55,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-10 20:24:55,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 43 transitions. [2020-07-10 20:24:55,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 43 transitions. [2020-07-10 20:24:55,704 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:55,706 INFO L225 Difference]: With dead ends: 43 [2020-07-10 20:24:55,706 INFO L226 Difference]: Without dead ends: 38 [2020-07-10 20:24:55,707 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2020-07-10 20:24:55,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2020-07-10 20:24:55,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2020-07-10 20:24:55,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:55,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:55,746 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:55,746 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 37 states. [2020-07-10 20:24:55,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,748 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:24:55,748 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:24:55,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,748 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand 38 states. [2020-07-10 20:24:55,748 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 38 states. [2020-07-10 20:24:55,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:55,750 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2020-07-10 20:24:55,750 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2020-07-10 20:24:55,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:55,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:55,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:55,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:55,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-07-10 20:24:55,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2020-07-10 20:24:55,753 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 31 [2020-07-10 20:24:55,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:55,753 INFO L479 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2020-07-10 20:24:55,754 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-07-10 20:24:55,754 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 37 states and 37 transitions. [2020-07-10 20:24:55,801 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-10 20:24:55,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2020-07-10 20:24:55,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2020-07-10 20:24:55,802 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:55,802 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:55,803 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-10 20:24:55,803 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:55,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:55,803 INFO L82 PathProgramCache]: Analyzing trace with hash 1774497961, now seen corresponding path program 4 times [2020-07-10 20:24:55,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:55,804 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1159565241] [2020-07-10 20:24:55,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:56,145 INFO L280 TraceCheckUtils]: 0: Hoare triple {1059#true} assume true; {1059#true} is VALID [2020-07-10 20:24:56,145 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1059#true} {1059#true} #55#return; {1059#true} is VALID [2020-07-10 20:24:56,145 INFO L263 TraceCheckUtils]: 0: Hoare triple {1059#true} call ULTIMATE.init(); {1059#true} is VALID [2020-07-10 20:24:56,146 INFO L280 TraceCheckUtils]: 1: Hoare triple {1059#true} assume true; {1059#true} is VALID [2020-07-10 20:24:56,146 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1059#true} {1059#true} #55#return; {1059#true} is VALID [2020-07-10 20:24:56,146 INFO L263 TraceCheckUtils]: 3: Hoare triple {1059#true} call #t~ret2 := main(); {1059#true} is VALID [2020-07-10 20:24:56,147 INFO L280 TraceCheckUtils]: 4: Hoare triple {1059#true} havoc ~x~0; {1059#true} is VALID [2020-07-10 20:24:56,147 INFO L280 TraceCheckUtils]: 5: Hoare triple {1059#true} havoc ~y~0; {1059#true} is VALID [2020-07-10 20:24:56,151 INFO L280 TraceCheckUtils]: 6: Hoare triple {1059#true} ~x~0 := -50; {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,153 INFO L280 TraceCheckUtils]: 7: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,156 INFO L280 TraceCheckUtils]: 8: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,156 INFO L280 TraceCheckUtils]: 9: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,157 INFO L280 TraceCheckUtils]: 10: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,158 INFO L280 TraceCheckUtils]: 11: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {1063#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:56,159 INFO L280 TraceCheckUtils]: 12: Hoare triple {1063#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {1064#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:24:56,160 INFO L280 TraceCheckUtils]: 13: Hoare triple {1064#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {1065#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:24:56,161 INFO L280 TraceCheckUtils]: 14: Hoare triple {1065#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {1066#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:56,162 INFO L280 TraceCheckUtils]: 15: Hoare triple {1066#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {1066#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:56,162 INFO L280 TraceCheckUtils]: 16: Hoare triple {1066#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {1066#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:56,163 INFO L280 TraceCheckUtils]: 17: Hoare triple {1066#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {1067#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:56,163 INFO L280 TraceCheckUtils]: 18: Hoare triple {1067#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {1068#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:24:56,164 INFO L280 TraceCheckUtils]: 19: Hoare triple {1068#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:56,165 INFO L280 TraceCheckUtils]: 20: Hoare triple {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:56,172 INFO L280 TraceCheckUtils]: 21: Hoare triple {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:56,174 INFO L280 TraceCheckUtils]: 22: Hoare triple {1069#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1070#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:56,175 INFO L280 TraceCheckUtils]: 23: Hoare triple {1070#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {1071#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:24:56,179 INFO L280 TraceCheckUtils]: 24: Hoare triple {1071#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:56,180 INFO L280 TraceCheckUtils]: 25: Hoare triple {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:56,181 INFO L280 TraceCheckUtils]: 26: Hoare triple {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:56,182 INFO L280 TraceCheckUtils]: 27: Hoare triple {1072#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1073#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:56,183 INFO L280 TraceCheckUtils]: 28: Hoare triple {1073#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {1074#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:24:56,184 INFO L280 TraceCheckUtils]: 29: Hoare triple {1074#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1075#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:56,184 INFO L280 TraceCheckUtils]: 30: Hoare triple {1075#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {1075#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:56,185 INFO L280 TraceCheckUtils]: 31: Hoare triple {1075#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !(~x~0 < 0); {1076#(<= 15 main_~y~0)} is VALID [2020-07-10 20:24:56,186 INFO L263 TraceCheckUtils]: 32: Hoare triple {1076#(<= 15 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {1077#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:56,196 INFO L280 TraceCheckUtils]: 33: Hoare triple {1077#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1078#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:56,196 INFO L280 TraceCheckUtils]: 34: Hoare triple {1078#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1060#false} is VALID [2020-07-10 20:24:56,197 INFO L280 TraceCheckUtils]: 35: Hoare triple {1060#false} assume !false; {1060#false} is VALID [2020-07-10 20:24:56,200 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-10 20:24:56,200 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:56,200 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1159565241] [2020-07-10 20:24:56,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:56,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2020-07-10 20:24:56,201 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999689352] [2020-07-10 20:24:56,201 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-07-10 20:24:56,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:56,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states. [2020-07-10 20:24:56,243 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:56,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2020-07-10 20:24:56,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:56,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2020-07-10 20:24:56,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=269, Unknown=0, NotChecked=0, Total=306 [2020-07-10 20:24:56,244 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 18 states. [2020-07-10 20:24:57,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:57,263 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-10 20:24:57,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-07-10 20:24:57,263 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 36 [2020-07-10 20:24:57,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 20:24:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2020-07-10 20:24:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2020-07-10 20:24:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 48 transitions. [2020-07-10 20:24:57,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 22 states and 48 transitions. [2020-07-10 20:24:57,321 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-10 20:24:57,323 INFO L225 Difference]: With dead ends: 48 [2020-07-10 20:24:57,323 INFO L226 Difference]: Without dead ends: 43 [2020-07-10 20:24:57,325 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=670, Unknown=0, NotChecked=0, Total=756 [2020-07-10 20:24:57,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2020-07-10 20:24:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2020-07-10 20:24:57,372 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:57,373 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand 42 states. [2020-07-10 20:24:57,373 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 42 states. [2020-07-10 20:24:57,373 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 42 states. [2020-07-10 20:24:57,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:57,375 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:24:57,375 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 20:24:57,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:57,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:57,376 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 43 states. [2020-07-10 20:24:57,376 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 43 states. [2020-07-10 20:24:57,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:57,381 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2020-07-10 20:24:57,381 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2020-07-10 20:24:57,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:57,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:57,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:57,388 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:57,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-07-10 20:24:57,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2020-07-10 20:24:57,393 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 36 [2020-07-10 20:24:57,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:57,394 INFO L479 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2020-07-10 20:24:57,394 INFO L480 AbstractCegarLoop]: Interpolant automaton has 18 states. [2020-07-10 20:24:57,394 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 42 states and 42 transitions. [2020-07-10 20:24:57,475 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-10 20:24:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2020-07-10 20:24:57,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-07-10 20:24:57,477 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:57,477 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:57,477 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 20:24:57,478 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:57,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:57,478 INFO L82 PathProgramCache]: Analyzing trace with hash -194454825, now seen corresponding path program 5 times [2020-07-10 20:24:57,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:57,479 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [281206157] [2020-07-10 20:24:57,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:57,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:24:57,932 INFO L280 TraceCheckUtils]: 0: Hoare triple {1367#true} assume true; {1367#true} is VALID [2020-07-10 20:24:57,933 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1367#true} {1367#true} #55#return; {1367#true} is VALID [2020-07-10 20:24:57,933 INFO L263 TraceCheckUtils]: 0: Hoare triple {1367#true} call ULTIMATE.init(); {1367#true} is VALID [2020-07-10 20:24:57,933 INFO L280 TraceCheckUtils]: 1: Hoare triple {1367#true} assume true; {1367#true} is VALID [2020-07-10 20:24:57,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1367#true} {1367#true} #55#return; {1367#true} is VALID [2020-07-10 20:24:57,934 INFO L263 TraceCheckUtils]: 3: Hoare triple {1367#true} call #t~ret2 := main(); {1367#true} is VALID [2020-07-10 20:24:57,934 INFO L280 TraceCheckUtils]: 4: Hoare triple {1367#true} havoc ~x~0; {1367#true} is VALID [2020-07-10 20:24:57,934 INFO L280 TraceCheckUtils]: 5: Hoare triple {1367#true} havoc ~y~0; {1367#true} is VALID [2020-07-10 20:24:57,937 INFO L280 TraceCheckUtils]: 6: Hoare triple {1367#true} ~x~0 := -50; {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,939 INFO L280 TraceCheckUtils]: 7: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,940 INFO L280 TraceCheckUtils]: 8: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,940 INFO L280 TraceCheckUtils]: 9: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,941 INFO L280 TraceCheckUtils]: 10: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,941 INFO L280 TraceCheckUtils]: 11: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {1371#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:24:57,942 INFO L280 TraceCheckUtils]: 12: Hoare triple {1371#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {1372#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:24:57,942 INFO L280 TraceCheckUtils]: 13: Hoare triple {1372#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {1373#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:24:57,943 INFO L280 TraceCheckUtils]: 14: Hoare triple {1373#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {1374#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:57,943 INFO L280 TraceCheckUtils]: 15: Hoare triple {1374#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {1374#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:57,944 INFO L280 TraceCheckUtils]: 16: Hoare triple {1374#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {1374#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:24:57,946 INFO L280 TraceCheckUtils]: 17: Hoare triple {1374#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {1375#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:57,947 INFO L280 TraceCheckUtils]: 18: Hoare triple {1375#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {1376#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:24:57,948 INFO L280 TraceCheckUtils]: 19: Hoare triple {1376#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:57,949 INFO L280 TraceCheckUtils]: 20: Hoare triple {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:57,949 INFO L280 TraceCheckUtils]: 21: Hoare triple {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:24:57,950 INFO L280 TraceCheckUtils]: 22: Hoare triple {1377#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1378#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:57,951 INFO L280 TraceCheckUtils]: 23: Hoare triple {1378#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {1379#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:24:57,952 INFO L280 TraceCheckUtils]: 24: Hoare triple {1379#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:57,952 INFO L280 TraceCheckUtils]: 25: Hoare triple {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:57,953 INFO L280 TraceCheckUtils]: 26: Hoare triple {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:24:57,954 INFO L280 TraceCheckUtils]: 27: Hoare triple {1380#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1381#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:57,954 INFO L280 TraceCheckUtils]: 28: Hoare triple {1381#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {1382#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:24:57,955 INFO L280 TraceCheckUtils]: 29: Hoare triple {1382#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:57,956 INFO L280 TraceCheckUtils]: 30: Hoare triple {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:57,957 INFO L280 TraceCheckUtils]: 31: Hoare triple {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:24:57,960 INFO L280 TraceCheckUtils]: 32: Hoare triple {1383#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1384#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:24:57,961 INFO L280 TraceCheckUtils]: 33: Hoare triple {1384#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {1385#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:24:57,962 INFO L280 TraceCheckUtils]: 34: Hoare triple {1385#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1386#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:24:57,962 INFO L280 TraceCheckUtils]: 35: Hoare triple {1386#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {1386#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:24:57,963 INFO L280 TraceCheckUtils]: 36: Hoare triple {1386#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !(~x~0 < 0); {1387#(<= 13 main_~y~0)} is VALID [2020-07-10 20:24:57,964 INFO L263 TraceCheckUtils]: 37: Hoare triple {1387#(<= 13 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {1388#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:24:57,964 INFO L280 TraceCheckUtils]: 38: Hoare triple {1388#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1389#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:24:57,964 INFO L280 TraceCheckUtils]: 39: Hoare triple {1389#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1368#false} is VALID [2020-07-10 20:24:57,965 INFO L280 TraceCheckUtils]: 40: Hoare triple {1368#false} assume !false; {1368#false} is VALID [2020-07-10 20:24:57,968 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-10 20:24:57,968 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:24:57,968 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [281206157] [2020-07-10 20:24:57,968 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:24:57,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2020-07-10 20:24:57,969 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084590118] [2020-07-10 20:24:57,969 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-07-10 20:24:57,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:24:57,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 21 states. [2020-07-10 20:24:58,017 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-10 20:24:58,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2020-07-10 20:24:58,018 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:24:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-07-10 20:24:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=376, Unknown=0, NotChecked=0, Total=420 [2020-07-10 20:24:58,019 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 21 states. [2020-07-10 20:24:59,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,419 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-10 20:24:59,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2020-07-10 20:24:59,419 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 41 [2020-07-10 20:24:59,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:24:59,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:24:59,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2020-07-10 20:24:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 20:24:59,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 53 transitions. [2020-07-10 20:24:59,425 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 53 transitions. [2020-07-10 20:24:59,475 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:59,477 INFO L225 Difference]: With dead ends: 53 [2020-07-10 20:24:59,477 INFO L226 Difference]: Without dead ends: 48 [2020-07-10 20:24:59,478 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=953, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 20:24:59,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2020-07-10 20:24:59,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2020-07-10 20:24:59,526 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:24:59,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:59,526 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:59,526 INFO L87 Difference]: Start difference. First operand 48 states. Second operand 47 states. [2020-07-10 20:24:59,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,528 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-10 20:24:59,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:24:59,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:59,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:59,529 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 48 states. [2020-07-10 20:24:59,529 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 48 states. [2020-07-10 20:24:59,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:24:59,532 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2020-07-10 20:24:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2020-07-10 20:24:59,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:24:59,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:24:59,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:24:59,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:24:59,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-07-10 20:24:59,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2020-07-10 20:24:59,535 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 41 [2020-07-10 20:24:59,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:24:59,537 INFO L479 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2020-07-10 20:24:59,537 INFO L480 AbstractCegarLoop]: Interpolant automaton has 21 states. [2020-07-10 20:24:59,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 47 states and 47 transitions. [2020-07-10 20:24:59,585 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:24:59,586 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2020-07-10 20:24:59,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-07-10 20:24:59,587 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:24:59,587 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:24:59,587 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-10 20:24:59,587 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:24:59,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:24:59,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1783487849, now seen corresponding path program 6 times [2020-07-10 20:24:59,588 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:24:59,589 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [628135156] [2020-07-10 20:24:59,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:24:59,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:00,076 INFO L280 TraceCheckUtils]: 0: Hoare triple {1712#true} assume true; {1712#true} is VALID [2020-07-10 20:25:00,076 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {1712#true} {1712#true} #55#return; {1712#true} is VALID [2020-07-10 20:25:00,077 INFO L263 TraceCheckUtils]: 0: Hoare triple {1712#true} call ULTIMATE.init(); {1712#true} is VALID [2020-07-10 20:25:00,077 INFO L280 TraceCheckUtils]: 1: Hoare triple {1712#true} assume true; {1712#true} is VALID [2020-07-10 20:25:00,078 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {1712#true} {1712#true} #55#return; {1712#true} is VALID [2020-07-10 20:25:00,078 INFO L263 TraceCheckUtils]: 3: Hoare triple {1712#true} call #t~ret2 := main(); {1712#true} is VALID [2020-07-10 20:25:00,078 INFO L280 TraceCheckUtils]: 4: Hoare triple {1712#true} havoc ~x~0; {1712#true} is VALID [2020-07-10 20:25:00,079 INFO L280 TraceCheckUtils]: 5: Hoare triple {1712#true} havoc ~y~0; {1712#true} is VALID [2020-07-10 20:25:00,083 INFO L280 TraceCheckUtils]: 6: Hoare triple {1712#true} ~x~0 := -50; {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,083 INFO L280 TraceCheckUtils]: 7: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,084 INFO L280 TraceCheckUtils]: 8: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,084 INFO L280 TraceCheckUtils]: 9: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,085 INFO L280 TraceCheckUtils]: 10: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,085 INFO L280 TraceCheckUtils]: 11: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {1716#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:00,086 INFO L280 TraceCheckUtils]: 12: Hoare triple {1716#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {1717#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:25:00,086 INFO L280 TraceCheckUtils]: 13: Hoare triple {1717#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {1718#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:25:00,087 INFO L280 TraceCheckUtils]: 14: Hoare triple {1718#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {1719#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:00,087 INFO L280 TraceCheckUtils]: 15: Hoare triple {1719#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {1719#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:00,088 INFO L280 TraceCheckUtils]: 16: Hoare triple {1719#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {1719#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:00,088 INFO L280 TraceCheckUtils]: 17: Hoare triple {1719#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {1720#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:00,089 INFO L280 TraceCheckUtils]: 18: Hoare triple {1720#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {1721#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:25:00,090 INFO L280 TraceCheckUtils]: 19: Hoare triple {1721#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:00,090 INFO L280 TraceCheckUtils]: 20: Hoare triple {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:00,091 INFO L280 TraceCheckUtils]: 21: Hoare triple {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:00,092 INFO L280 TraceCheckUtils]: 22: Hoare triple {1722#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1723#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:00,092 INFO L280 TraceCheckUtils]: 23: Hoare triple {1723#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {1724#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:25:00,093 INFO L280 TraceCheckUtils]: 24: Hoare triple {1724#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:00,093 INFO L280 TraceCheckUtils]: 25: Hoare triple {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:00,094 INFO L280 TraceCheckUtils]: 26: Hoare triple {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:00,095 INFO L280 TraceCheckUtils]: 27: Hoare triple {1725#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1726#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:00,096 INFO L280 TraceCheckUtils]: 28: Hoare triple {1726#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {1727#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:25:00,097 INFO L280 TraceCheckUtils]: 29: Hoare triple {1727#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:00,097 INFO L280 TraceCheckUtils]: 30: Hoare triple {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:00,097 INFO L280 TraceCheckUtils]: 31: Hoare triple {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:00,098 INFO L280 TraceCheckUtils]: 32: Hoare triple {1728#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1729#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:00,099 INFO L280 TraceCheckUtils]: 33: Hoare triple {1729#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {1730#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:25:00,099 INFO L280 TraceCheckUtils]: 34: Hoare triple {1730#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:00,100 INFO L280 TraceCheckUtils]: 35: Hoare triple {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:00,100 INFO L280 TraceCheckUtils]: 36: Hoare triple {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !!(~x~0 < 0); {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:00,101 INFO L280 TraceCheckUtils]: 37: Hoare triple {1731#(<= (+ main_~x~0 65) (* 5 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {1732#(<= (+ main_~x~0 65) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:00,101 INFO L280 TraceCheckUtils]: 38: Hoare triple {1732#(<= (+ main_~x~0 65) (* 6 main_~y~0))} #t~post1 := ~y~0; {1733#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} is VALID [2020-07-10 20:25:00,102 INFO L280 TraceCheckUtils]: 39: Hoare triple {1733#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {1734#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:00,102 INFO L280 TraceCheckUtils]: 40: Hoare triple {1734#(<= (+ main_~x~0 71) (* 6 main_~y~0))} havoc #t~post1; {1734#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:00,103 INFO L280 TraceCheckUtils]: 41: Hoare triple {1734#(<= (+ main_~x~0 71) (* 6 main_~y~0))} assume !(~x~0 < 0); {1735#(<= 12 main_~y~0)} is VALID [2020-07-10 20:25:00,104 INFO L263 TraceCheckUtils]: 42: Hoare triple {1735#(<= 12 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:00,104 INFO L280 TraceCheckUtils]: 43: Hoare triple {1736#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1737#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:00,105 INFO L280 TraceCheckUtils]: 44: Hoare triple {1737#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {1713#false} is VALID [2020-07-10 20:25:00,105 INFO L280 TraceCheckUtils]: 45: Hoare triple {1713#false} assume !false; {1713#false} is VALID [2020-07-10 20:25:00,108 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-10 20:25:00,108 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:00,108 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [628135156] [2020-07-10 20:25:00,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:00,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2020-07-10 20:25:00,109 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130209431] [2020-07-10 20:25:00,109 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2020-07-10 20:25:00,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:00,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states. [2020-07-10 20:25:00,165 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-10 20:25:00,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2020-07-10 20:25:00,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:00,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2020-07-10 20:25:00,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2020-07-10 20:25:00,167 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2020-07-10 20:25:01,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:01,982 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-10 20:25:01,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2020-07-10 20:25:01,983 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2020-07-10 20:25:01,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:01,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:01,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-07-10 20:25:01,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-07-10 20:25:01,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 58 transitions. [2020-07-10 20:25:01,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 31 states and 58 transitions. [2020-07-10 20:25:02,057 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:02,059 INFO L225 Difference]: With dead ends: 58 [2020-07-10 20:25:02,059 INFO L226 Difference]: Without dead ends: 53 [2020-07-10 20:25:02,060 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=125, Invalid=1357, Unknown=0, NotChecked=0, Total=1482 [2020-07-10 20:25:02,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2020-07-10 20:25:02,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2020-07-10 20:25:02,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:02,118 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand 52 states. [2020-07-10 20:25:02,118 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand 52 states. [2020-07-10 20:25:02,118 INFO L87 Difference]: Start difference. First operand 53 states. Second operand 52 states. [2020-07-10 20:25:02,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:02,120 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-10 20:25:02,121 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-10 20:25:02,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:02,121 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:02,121 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 53 states. [2020-07-10 20:25:02,121 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 53 states. [2020-07-10 20:25:02,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:02,123 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2020-07-10 20:25:02,124 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2020-07-10 20:25:02,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:02,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:02,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:02,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:02,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2020-07-10 20:25:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2020-07-10 20:25:02,126 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 46 [2020-07-10 20:25:02,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:02,127 INFO L479 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2020-07-10 20:25:02,127 INFO L480 AbstractCegarLoop]: Interpolant automaton has 24 states. [2020-07-10 20:25:02,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 52 states and 52 transitions. [2020-07-10 20:25:02,186 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:02,186 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2020-07-10 20:25:02,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-07-10 20:25:02,187 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:02,188 INFO L422 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:02,188 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-10 20:25:02,188 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:02,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:02,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1046324759, now seen corresponding path program 7 times [2020-07-10 20:25:02,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:02,189 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1522687569] [2020-07-10 20:25:02,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:02,789 INFO L280 TraceCheckUtils]: 0: Hoare triple {2096#true} assume true; {2096#true} is VALID [2020-07-10 20:25:02,789 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2096#true} {2096#true} #55#return; {2096#true} is VALID [2020-07-10 20:25:02,790 INFO L263 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2020-07-10 20:25:02,790 INFO L280 TraceCheckUtils]: 1: Hoare triple {2096#true} assume true; {2096#true} is VALID [2020-07-10 20:25:02,790 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2096#true} {2096#true} #55#return; {2096#true} is VALID [2020-07-10 20:25:02,790 INFO L263 TraceCheckUtils]: 3: Hoare triple {2096#true} call #t~ret2 := main(); {2096#true} is VALID [2020-07-10 20:25:02,790 INFO L280 TraceCheckUtils]: 4: Hoare triple {2096#true} havoc ~x~0; {2096#true} is VALID [2020-07-10 20:25:02,791 INFO L280 TraceCheckUtils]: 5: Hoare triple {2096#true} havoc ~y~0; {2096#true} is VALID [2020-07-10 20:25:02,794 INFO L280 TraceCheckUtils]: 6: Hoare triple {2096#true} ~x~0 := -50; {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,795 INFO L280 TraceCheckUtils]: 7: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,795 INFO L280 TraceCheckUtils]: 8: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,796 INFO L280 TraceCheckUtils]: 9: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,796 INFO L280 TraceCheckUtils]: 10: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,797 INFO L280 TraceCheckUtils]: 11: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {2100#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:02,798 INFO L280 TraceCheckUtils]: 12: Hoare triple {2100#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {2101#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:25:02,799 INFO L280 TraceCheckUtils]: 13: Hoare triple {2101#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {2102#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:25:02,799 INFO L280 TraceCheckUtils]: 14: Hoare triple {2102#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {2103#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:02,800 INFO L280 TraceCheckUtils]: 15: Hoare triple {2103#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {2103#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:02,800 INFO L280 TraceCheckUtils]: 16: Hoare triple {2103#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {2103#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:02,801 INFO L280 TraceCheckUtils]: 17: Hoare triple {2103#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {2104#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:02,802 INFO L280 TraceCheckUtils]: 18: Hoare triple {2104#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {2105#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,803 INFO L280 TraceCheckUtils]: 19: Hoare triple {2105#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:02,803 INFO L280 TraceCheckUtils]: 20: Hoare triple {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:02,804 INFO L280 TraceCheckUtils]: 21: Hoare triple {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:02,804 INFO L280 TraceCheckUtils]: 22: Hoare triple {2106#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2107#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:02,805 INFO L280 TraceCheckUtils]: 23: Hoare triple {2107#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {2108#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,806 INFO L280 TraceCheckUtils]: 24: Hoare triple {2108#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:02,806 INFO L280 TraceCheckUtils]: 25: Hoare triple {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:02,806 INFO L280 TraceCheckUtils]: 26: Hoare triple {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:02,807 INFO L280 TraceCheckUtils]: 27: Hoare triple {2109#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2110#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:02,808 INFO L280 TraceCheckUtils]: 28: Hoare triple {2110#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {2111#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,808 INFO L280 TraceCheckUtils]: 29: Hoare triple {2111#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:02,809 INFO L280 TraceCheckUtils]: 30: Hoare triple {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:02,809 INFO L280 TraceCheckUtils]: 31: Hoare triple {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:02,815 INFO L280 TraceCheckUtils]: 32: Hoare triple {2112#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2113#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:02,816 INFO L280 TraceCheckUtils]: 33: Hoare triple {2113#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {2114#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,816 INFO L280 TraceCheckUtils]: 34: Hoare triple {2114#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:02,817 INFO L280 TraceCheckUtils]: 35: Hoare triple {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:02,817 INFO L280 TraceCheckUtils]: 36: Hoare triple {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !!(~x~0 < 0); {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:02,818 INFO L280 TraceCheckUtils]: 37: Hoare triple {2115#(<= (+ main_~x~0 65) (* 5 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2116#(<= (+ main_~x~0 65) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:02,819 INFO L280 TraceCheckUtils]: 38: Hoare triple {2116#(<= (+ main_~x~0 65) (* 6 main_~y~0))} #t~post1 := ~y~0; {2117#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,820 INFO L280 TraceCheckUtils]: 39: Hoare triple {2117#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:02,820 INFO L280 TraceCheckUtils]: 40: Hoare triple {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} havoc #t~post1; {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:02,821 INFO L280 TraceCheckUtils]: 41: Hoare triple {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} assume !!(~x~0 < 0); {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:02,822 INFO L280 TraceCheckUtils]: 42: Hoare triple {2118#(<= (+ main_~x~0 71) (* 6 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2119#(<= (+ main_~x~0 71) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:02,822 INFO L280 TraceCheckUtils]: 43: Hoare triple {2119#(<= (+ main_~x~0 71) (* 7 main_~y~0))} #t~post1 := ~y~0; {2120#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} is VALID [2020-07-10 20:25:02,823 INFO L280 TraceCheckUtils]: 44: Hoare triple {2120#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2121#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:02,823 INFO L280 TraceCheckUtils]: 45: Hoare triple {2121#(<= (+ main_~x~0 78) (* 7 main_~y~0))} havoc #t~post1; {2121#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:02,824 INFO L280 TraceCheckUtils]: 46: Hoare triple {2121#(<= (+ main_~x~0 78) (* 7 main_~y~0))} assume !(~x~0 < 0); {2122#(<= 12 main_~y~0)} is VALID [2020-07-10 20:25:02,825 INFO L263 TraceCheckUtils]: 47: Hoare triple {2122#(<= 12 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {2123#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:02,826 INFO L280 TraceCheckUtils]: 48: Hoare triple {2123#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2124#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:02,827 INFO L280 TraceCheckUtils]: 49: Hoare triple {2124#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2097#false} is VALID [2020-07-10 20:25:02,827 INFO L280 TraceCheckUtils]: 50: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2020-07-10 20:25:02,831 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-10 20:25:02,832 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:02,832 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1522687569] [2020-07-10 20:25:02,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:02,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2020-07-10 20:25:02,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850571400] [2020-07-10 20:25:02,833 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2020-07-10 20:25:02,833 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:02,833 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states. [2020-07-10 20:25:02,890 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-10 20:25:02,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2020-07-10 20:25:02,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:02,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2020-07-10 20:25:02,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=644, Unknown=0, NotChecked=0, Total=702 [2020-07-10 20:25:02,892 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 27 states. [2020-07-10 20:25:05,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,142 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-07-10 20:25:05,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2020-07-10 20:25:05,143 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 51 [2020-07-10 20:25:05,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:25:05,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2020-07-10 20:25:05,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 20:25:05,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 63 transitions. [2020-07-10 20:25:05,148 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states and 63 transitions. [2020-07-10 20:25:05,228 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:05,229 INFO L225 Difference]: With dead ends: 63 [2020-07-10 20:25:05,229 INFO L226 Difference]: Without dead ends: 58 [2020-07-10 20:25:05,231 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 337 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=147, Invalid=1833, Unknown=0, NotChecked=0, Total=1980 [2020-07-10 20:25:05,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2020-07-10 20:25:05,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2020-07-10 20:25:05,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:05,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand 57 states. [2020-07-10 20:25:05,302 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand 57 states. [2020-07-10 20:25:05,302 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 57 states. [2020-07-10 20:25:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,304 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-10 20:25:05,304 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-10 20:25:05,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:05,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:05,304 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand 58 states. [2020-07-10 20:25:05,304 INFO L87 Difference]: Start difference. First operand 57 states. Second operand 58 states. [2020-07-10 20:25:05,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:05,306 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2020-07-10 20:25:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2020-07-10 20:25:05,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:05,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:05,307 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:05,307 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:05,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2020-07-10 20:25:05,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2020-07-10 20:25:05,308 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 51 [2020-07-10 20:25:05,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:05,309 INFO L479 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2020-07-10 20:25:05,309 INFO L480 AbstractCegarLoop]: Interpolant automaton has 27 states. [2020-07-10 20:25:05,309 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 57 states and 57 transitions. [2020-07-10 20:25:05,385 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:05,386 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2020-07-10 20:25:05,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2020-07-10 20:25:05,387 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:05,387 INFO L422 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:05,387 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-07-10 20:25:05,388 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:05,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:05,388 INFO L82 PathProgramCache]: Analyzing trace with hash 232135209, now seen corresponding path program 8 times [2020-07-10 20:25:05,388 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:05,389 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [497536217] [2020-07-10 20:25:05,389 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:06,133 INFO L280 TraceCheckUtils]: 0: Hoare triple {2519#true} assume true; {2519#true} is VALID [2020-07-10 20:25:06,133 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2519#true} {2519#true} #55#return; {2519#true} is VALID [2020-07-10 20:25:06,134 INFO L263 TraceCheckUtils]: 0: Hoare triple {2519#true} call ULTIMATE.init(); {2519#true} is VALID [2020-07-10 20:25:06,134 INFO L280 TraceCheckUtils]: 1: Hoare triple {2519#true} assume true; {2519#true} is VALID [2020-07-10 20:25:06,134 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2519#true} {2519#true} #55#return; {2519#true} is VALID [2020-07-10 20:25:06,134 INFO L263 TraceCheckUtils]: 3: Hoare triple {2519#true} call #t~ret2 := main(); {2519#true} is VALID [2020-07-10 20:25:06,134 INFO L280 TraceCheckUtils]: 4: Hoare triple {2519#true} havoc ~x~0; {2519#true} is VALID [2020-07-10 20:25:06,135 INFO L280 TraceCheckUtils]: 5: Hoare triple {2519#true} havoc ~y~0; {2519#true} is VALID [2020-07-10 20:25:06,136 INFO L280 TraceCheckUtils]: 6: Hoare triple {2519#true} ~x~0 := -50; {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,136 INFO L280 TraceCheckUtils]: 7: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,137 INFO L280 TraceCheckUtils]: 8: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,137 INFO L280 TraceCheckUtils]: 9: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,138 INFO L280 TraceCheckUtils]: 10: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,138 INFO L280 TraceCheckUtils]: 11: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {2523#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:06,139 INFO L280 TraceCheckUtils]: 12: Hoare triple {2523#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {2524#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:25:06,140 INFO L280 TraceCheckUtils]: 13: Hoare triple {2524#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {2525#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:25:06,141 INFO L280 TraceCheckUtils]: 14: Hoare triple {2525#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {2526#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:06,141 INFO L280 TraceCheckUtils]: 15: Hoare triple {2526#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {2526#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:06,141 INFO L280 TraceCheckUtils]: 16: Hoare triple {2526#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {2526#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:06,142 INFO L280 TraceCheckUtils]: 17: Hoare triple {2526#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {2527#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:06,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {2527#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {2528#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,143 INFO L280 TraceCheckUtils]: 19: Hoare triple {2528#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:06,144 INFO L280 TraceCheckUtils]: 20: Hoare triple {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:06,144 INFO L280 TraceCheckUtils]: 21: Hoare triple {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:06,145 INFO L280 TraceCheckUtils]: 22: Hoare triple {2529#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2530#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:06,145 INFO L280 TraceCheckUtils]: 23: Hoare triple {2530#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {2531#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,146 INFO L280 TraceCheckUtils]: 24: Hoare triple {2531#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:06,146 INFO L280 TraceCheckUtils]: 25: Hoare triple {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:06,147 INFO L280 TraceCheckUtils]: 26: Hoare triple {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:06,155 INFO L280 TraceCheckUtils]: 27: Hoare triple {2532#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2533#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:06,161 INFO L280 TraceCheckUtils]: 28: Hoare triple {2533#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {2534#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,163 INFO L280 TraceCheckUtils]: 29: Hoare triple {2534#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:06,165 INFO L280 TraceCheckUtils]: 30: Hoare triple {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:06,167 INFO L280 TraceCheckUtils]: 31: Hoare triple {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:06,168 INFO L280 TraceCheckUtils]: 32: Hoare triple {2535#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2536#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:06,169 INFO L280 TraceCheckUtils]: 33: Hoare triple {2536#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {2537#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,170 INFO L280 TraceCheckUtils]: 34: Hoare triple {2537#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:06,171 INFO L280 TraceCheckUtils]: 35: Hoare triple {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:06,171 INFO L280 TraceCheckUtils]: 36: Hoare triple {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !!(~x~0 < 0); {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:06,182 INFO L280 TraceCheckUtils]: 37: Hoare triple {2538#(<= (+ main_~x~0 65) (* 5 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2539#(<= (+ main_~x~0 65) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:06,183 INFO L280 TraceCheckUtils]: 38: Hoare triple {2539#(<= (+ main_~x~0 65) (* 6 main_~y~0))} #t~post1 := ~y~0; {2540#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,184 INFO L280 TraceCheckUtils]: 39: Hoare triple {2540#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:06,184 INFO L280 TraceCheckUtils]: 40: Hoare triple {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} havoc #t~post1; {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:06,185 INFO L280 TraceCheckUtils]: 41: Hoare triple {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} assume !!(~x~0 < 0); {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:06,186 INFO L280 TraceCheckUtils]: 42: Hoare triple {2541#(<= (+ main_~x~0 71) (* 6 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2542#(<= (+ main_~x~0 71) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:06,187 INFO L280 TraceCheckUtils]: 43: Hoare triple {2542#(<= (+ main_~x~0 71) (* 7 main_~y~0))} #t~post1 := ~y~0; {2543#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,188 INFO L280 TraceCheckUtils]: 44: Hoare triple {2543#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:06,188 INFO L280 TraceCheckUtils]: 45: Hoare triple {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} havoc #t~post1; {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:06,189 INFO L280 TraceCheckUtils]: 46: Hoare triple {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} assume !!(~x~0 < 0); {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:06,190 INFO L280 TraceCheckUtils]: 47: Hoare triple {2544#(<= (+ main_~x~0 78) (* 7 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2545#(<= (+ main_~x~0 78) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:06,190 INFO L280 TraceCheckUtils]: 48: Hoare triple {2545#(<= (+ main_~x~0 78) (* 8 main_~y~0))} #t~post1 := ~y~0; {2546#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} is VALID [2020-07-10 20:25:06,191 INFO L280 TraceCheckUtils]: 49: Hoare triple {2546#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2547#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:06,192 INFO L280 TraceCheckUtils]: 50: Hoare triple {2547#(<= (+ main_~x~0 86) (* 8 main_~y~0))} havoc #t~post1; {2547#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:06,192 INFO L280 TraceCheckUtils]: 51: Hoare triple {2547#(<= (+ main_~x~0 86) (* 8 main_~y~0))} assume !(~x~0 < 0); {2548#(<= 11 main_~y~0)} is VALID [2020-07-10 20:25:06,193 INFO L263 TraceCheckUtils]: 52: Hoare triple {2548#(<= 11 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {2549#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:06,194 INFO L280 TraceCheckUtils]: 53: Hoare triple {2549#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {2550#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:06,195 INFO L280 TraceCheckUtils]: 54: Hoare triple {2550#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2520#false} is VALID [2020-07-10 20:25:06,195 INFO L280 TraceCheckUtils]: 55: Hoare triple {2520#false} assume !false; {2520#false} is VALID [2020-07-10 20:25:06,200 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-10 20:25:06,201 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:06,201 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [497536217] [2020-07-10 20:25:06,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:06,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2020-07-10 20:25:06,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919047386] [2020-07-10 20:25:06,202 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2020-07-10 20:25:06,202 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:06,203 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 30 states. [2020-07-10 20:25:06,262 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:06,262 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2020-07-10 20:25:06,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:06,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2020-07-10 20:25:06,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=805, Unknown=0, NotChecked=0, Total=870 [2020-07-10 20:25:06,264 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 30 states. [2020-07-10 20:25:09,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,021 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-07-10 20:25:09,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2020-07-10 20:25:09,022 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 56 [2020-07-10 20:25:09,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:09,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:25:09,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. [2020-07-10 20:25:09,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-07-10 20:25:09,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 68 transitions. [2020-07-10 20:25:09,026 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 41 states and 68 transitions. [2020-07-10 20:25:09,118 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:09,121 INFO L225 Difference]: With dead ends: 68 [2020-07-10 20:25:09,121 INFO L226 Difference]: Without dead ends: 63 [2020-07-10 20:25:09,123 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=170, Invalid=2380, Unknown=0, NotChecked=0, Total=2550 [2020-07-10 20:25:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2020-07-10 20:25:09,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2020-07-10 20:25:09,196 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:09,196 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand 62 states. [2020-07-10 20:25:09,197 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand 62 states. [2020-07-10 20:25:09,197 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 62 states. [2020-07-10 20:25:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,199 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-07-10 20:25:09,199 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2020-07-10 20:25:09,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:09,200 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:09,200 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 63 states. [2020-07-10 20:25:09,200 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 63 states. [2020-07-10 20:25:09,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:09,202 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2020-07-10 20:25:09,202 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2020-07-10 20:25:09,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:09,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:09,202 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:09,203 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:09,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2020-07-10 20:25:09,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2020-07-10 20:25:09,204 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 56 [2020-07-10 20:25:09,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:09,204 INFO L479 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2020-07-10 20:25:09,205 INFO L480 AbstractCegarLoop]: Interpolant automaton has 30 states. [2020-07-10 20:25:09,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 62 states and 62 transitions. [2020-07-10 20:25:09,285 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:09,285 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2020-07-10 20:25:09,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-07-10 20:25:09,286 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:09,286 INFO L422 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:09,286 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-07-10 20:25:09,287 INFO L427 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:09,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:09,287 INFO L82 PathProgramCache]: Analyzing trace with hash 977101143, now seen corresponding path program 9 times [2020-07-10 20:25:09,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:09,287 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [812066976] [2020-07-10 20:25:09,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:10,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:10,217 INFO L280 TraceCheckUtils]: 0: Hoare triple {2981#true} assume true; {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {2981#true} {2981#true} #55#return; {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L263 TraceCheckUtils]: 0: Hoare triple {2981#true} call ULTIMATE.init(); {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L280 TraceCheckUtils]: 1: Hoare triple {2981#true} assume true; {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {2981#true} {2981#true} #55#return; {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L263 TraceCheckUtils]: 3: Hoare triple {2981#true} call #t~ret2 := main(); {2981#true} is VALID [2020-07-10 20:25:10,218 INFO L280 TraceCheckUtils]: 4: Hoare triple {2981#true} havoc ~x~0; {2981#true} is VALID [2020-07-10 20:25:10,219 INFO L280 TraceCheckUtils]: 5: Hoare triple {2981#true} havoc ~y~0; {2981#true} is VALID [2020-07-10 20:25:10,219 INFO L280 TraceCheckUtils]: 6: Hoare triple {2981#true} ~x~0 := -50; {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,220 INFO L280 TraceCheckUtils]: 7: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,220 INFO L280 TraceCheckUtils]: 9: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,221 INFO L280 TraceCheckUtils]: 10: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,222 INFO L280 TraceCheckUtils]: 11: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {2985#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:10,223 INFO L280 TraceCheckUtils]: 12: Hoare triple {2985#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {2986#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:25:10,223 INFO L280 TraceCheckUtils]: 13: Hoare triple {2986#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {2987#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:25:10,224 INFO L280 TraceCheckUtils]: 14: Hoare triple {2987#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {2988#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:10,225 INFO L280 TraceCheckUtils]: 15: Hoare triple {2988#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {2988#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:10,225 INFO L280 TraceCheckUtils]: 16: Hoare triple {2988#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {2988#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:10,226 INFO L280 TraceCheckUtils]: 17: Hoare triple {2988#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {2989#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:10,226 INFO L280 TraceCheckUtils]: 18: Hoare triple {2989#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {2990#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,227 INFO L280 TraceCheckUtils]: 19: Hoare triple {2990#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:10,228 INFO L280 TraceCheckUtils]: 20: Hoare triple {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:10,229 INFO L280 TraceCheckUtils]: 21: Hoare triple {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:10,232 INFO L280 TraceCheckUtils]: 22: Hoare triple {2991#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2992#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:10,233 INFO L280 TraceCheckUtils]: 23: Hoare triple {2992#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {2993#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,234 INFO L280 TraceCheckUtils]: 24: Hoare triple {2993#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:10,234 INFO L280 TraceCheckUtils]: 25: Hoare triple {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:10,235 INFO L280 TraceCheckUtils]: 26: Hoare triple {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:10,236 INFO L280 TraceCheckUtils]: 27: Hoare triple {2994#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2995#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:10,236 INFO L280 TraceCheckUtils]: 28: Hoare triple {2995#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {2996#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,237 INFO L280 TraceCheckUtils]: 29: Hoare triple {2996#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:10,237 INFO L280 TraceCheckUtils]: 30: Hoare triple {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:10,238 INFO L280 TraceCheckUtils]: 31: Hoare triple {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:10,238 INFO L280 TraceCheckUtils]: 32: Hoare triple {2997#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {2998#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:10,239 INFO L280 TraceCheckUtils]: 33: Hoare triple {2998#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {2999#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,240 INFO L280 TraceCheckUtils]: 34: Hoare triple {2999#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:10,240 INFO L280 TraceCheckUtils]: 35: Hoare triple {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:10,240 INFO L280 TraceCheckUtils]: 36: Hoare triple {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !!(~x~0 < 0); {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:10,241 INFO L280 TraceCheckUtils]: 37: Hoare triple {3000#(<= (+ main_~x~0 65) (* 5 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3001#(<= (+ main_~x~0 65) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:10,242 INFO L280 TraceCheckUtils]: 38: Hoare triple {3001#(<= (+ main_~x~0 65) (* 6 main_~y~0))} #t~post1 := ~y~0; {3002#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,242 INFO L280 TraceCheckUtils]: 39: Hoare triple {3002#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:10,243 INFO L280 TraceCheckUtils]: 40: Hoare triple {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} havoc #t~post1; {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:10,243 INFO L280 TraceCheckUtils]: 41: Hoare triple {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} assume !!(~x~0 < 0); {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:10,244 INFO L280 TraceCheckUtils]: 42: Hoare triple {3003#(<= (+ main_~x~0 71) (* 6 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3004#(<= (+ main_~x~0 71) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:10,244 INFO L280 TraceCheckUtils]: 43: Hoare triple {3004#(<= (+ main_~x~0 71) (* 7 main_~y~0))} #t~post1 := ~y~0; {3005#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,245 INFO L280 TraceCheckUtils]: 44: Hoare triple {3005#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:10,246 INFO L280 TraceCheckUtils]: 45: Hoare triple {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} havoc #t~post1; {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:10,249 INFO L280 TraceCheckUtils]: 46: Hoare triple {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} assume !!(~x~0 < 0); {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:10,250 INFO L280 TraceCheckUtils]: 47: Hoare triple {3006#(<= (+ main_~x~0 78) (* 7 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3007#(<= (+ main_~x~0 78) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:10,251 INFO L280 TraceCheckUtils]: 48: Hoare triple {3007#(<= (+ main_~x~0 78) (* 8 main_~y~0))} #t~post1 := ~y~0; {3008#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,251 INFO L280 TraceCheckUtils]: 49: Hoare triple {3008#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:10,252 INFO L280 TraceCheckUtils]: 50: Hoare triple {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} havoc #t~post1; {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:10,252 INFO L280 TraceCheckUtils]: 51: Hoare triple {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} assume !!(~x~0 < 0); {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:10,253 INFO L280 TraceCheckUtils]: 52: Hoare triple {3009#(<= (+ main_~x~0 86) (* 8 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3010#(<= (+ main_~x~0 86) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:10,253 INFO L280 TraceCheckUtils]: 53: Hoare triple {3010#(<= (+ main_~x~0 86) (* 9 main_~y~0))} #t~post1 := ~y~0; {3011#(<= (+ main_~x~0 86) (* 9 |main_#t~post1|))} is VALID [2020-07-10 20:25:10,254 INFO L280 TraceCheckUtils]: 54: Hoare triple {3011#(<= (+ main_~x~0 86) (* 9 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3012#(<= (+ main_~x~0 95) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:10,254 INFO L280 TraceCheckUtils]: 55: Hoare triple {3012#(<= (+ main_~x~0 95) (* 9 main_~y~0))} havoc #t~post1; {3012#(<= (+ main_~x~0 95) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:10,255 INFO L280 TraceCheckUtils]: 56: Hoare triple {3012#(<= (+ main_~x~0 95) (* 9 main_~y~0))} assume !(~x~0 < 0); {3013#(<= 11 main_~y~0)} is VALID [2020-07-10 20:25:10,256 INFO L263 TraceCheckUtils]: 57: Hoare triple {3013#(<= 11 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {3014#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:10,256 INFO L280 TraceCheckUtils]: 58: Hoare triple {3014#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3015#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:10,257 INFO L280 TraceCheckUtils]: 59: Hoare triple {3015#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {2982#false} is VALID [2020-07-10 20:25:10,257 INFO L280 TraceCheckUtils]: 60: Hoare triple {2982#false} assume !false; {2982#false} is VALID [2020-07-10 20:25:10,262 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-10 20:25:10,262 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:10,262 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [812066976] [2020-07-10 20:25:10,262 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:10,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2020-07-10 20:25:10,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948807661] [2020-07-10 20:25:10,263 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2020-07-10 20:25:10,263 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:10,263 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 33 states. [2020-07-10 20:25:10,344 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:10,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2020-07-10 20:25:10,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:10,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2020-07-10 20:25:10,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=984, Unknown=0, NotChecked=0, Total=1056 [2020-07-10 20:25:10,346 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 33 states. [2020-07-10 20:25:13,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:13,843 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2020-07-10 20:25:13,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2020-07-10 20:25:13,843 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 61 [2020-07-10 20:25:13,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:13,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:25:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-07-10 20:25:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2020-07-10 20:25:13,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 73 transitions. [2020-07-10 20:25:13,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 46 states and 73 transitions. [2020-07-10 20:25:13,943 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:13,945 INFO L225 Difference]: With dead ends: 73 [2020-07-10 20:25:13,945 INFO L226 Difference]: Without dead ends: 68 [2020-07-10 20:25:13,946 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 588 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=194, Invalid=2998, Unknown=0, NotChecked=0, Total=3192 [2020-07-10 20:25:13,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-07-10 20:25:14,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2020-07-10 20:25:14,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:14,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand 67 states. [2020-07-10 20:25:14,018 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand 67 states. [2020-07-10 20:25:14,018 INFO L87 Difference]: Start difference. First operand 68 states. Second operand 67 states. [2020-07-10 20:25:14,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:14,020 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-07-10 20:25:14,021 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2020-07-10 20:25:14,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:14,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:14,021 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand 68 states. [2020-07-10 20:25:14,021 INFO L87 Difference]: Start difference. First operand 67 states. Second operand 68 states. [2020-07-10 20:25:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:14,023 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-07-10 20:25:14,023 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2020-07-10 20:25:14,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:14,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:14,023 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:14,023 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2020-07-10 20:25:14,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2020-07-10 20:25:14,025 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 61 [2020-07-10 20:25:14,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:14,025 INFO L479 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2020-07-10 20:25:14,025 INFO L480 AbstractCegarLoop]: Interpolant automaton has 33 states. [2020-07-10 20:25:14,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 67 states and 67 transitions. [2020-07-10 20:25:14,115 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:14,115 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2020-07-10 20:25:14,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-07-10 20:25:14,116 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 20:25:14,116 INFO L422 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 20:25:14,117 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-07-10 20:25:14,117 INFO L427 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 20:25:14,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 20:25:14,117 INFO L82 PathProgramCache]: Analyzing trace with hash 751396585, now seen corresponding path program 10 times [2020-07-10 20:25:14,117 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-07-10 20:25:14,118 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1311212375] [2020-07-10 20:25:14,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 20:25:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 20:25:15,102 INFO L280 TraceCheckUtils]: 0: Hoare triple {3482#true} assume true; {3482#true} is VALID [2020-07-10 20:25:15,102 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {3482#true} {3482#true} #55#return; {3482#true} is VALID [2020-07-10 20:25:15,102 INFO L263 TraceCheckUtils]: 0: Hoare triple {3482#true} call ULTIMATE.init(); {3482#true} is VALID [2020-07-10 20:25:15,103 INFO L280 TraceCheckUtils]: 1: Hoare triple {3482#true} assume true; {3482#true} is VALID [2020-07-10 20:25:15,103 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {3482#true} {3482#true} #55#return; {3482#true} is VALID [2020-07-10 20:25:15,103 INFO L263 TraceCheckUtils]: 3: Hoare triple {3482#true} call #t~ret2 := main(); {3482#true} is VALID [2020-07-10 20:25:15,103 INFO L280 TraceCheckUtils]: 4: Hoare triple {3482#true} havoc ~x~0; {3482#true} is VALID [2020-07-10 20:25:15,103 INFO L280 TraceCheckUtils]: 5: Hoare triple {3482#true} havoc ~y~0; {3482#true} is VALID [2020-07-10 20:25:15,104 INFO L280 TraceCheckUtils]: 6: Hoare triple {3482#true} ~x~0 := -50; {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,104 INFO L280 TraceCheckUtils]: 7: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647; {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,105 INFO L280 TraceCheckUtils]: 8: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} ~y~0 := #t~nondet0; {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,105 INFO L280 TraceCheckUtils]: 9: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} havoc #t~nondet0; {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,105 INFO L280 TraceCheckUtils]: 10: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} assume !!(-1000 < ~y~0 && ~y~0 < 1000000); {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,106 INFO L280 TraceCheckUtils]: 11: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} assume !!(~x~0 < 0); {3486#(<= (+ main_~x~0 50) 0)} is VALID [2020-07-10 20:25:15,107 INFO L280 TraceCheckUtils]: 12: Hoare triple {3486#(<= (+ main_~x~0 50) 0)} ~x~0 := ~x~0 + ~y~0; {3487#(<= (+ main_~x~0 50) main_~y~0)} is VALID [2020-07-10 20:25:15,107 INFO L280 TraceCheckUtils]: 13: Hoare triple {3487#(<= (+ main_~x~0 50) main_~y~0)} #t~post1 := ~y~0; {3488#(<= (+ main_~x~0 50) |main_#t~post1|)} is VALID [2020-07-10 20:25:15,108 INFO L280 TraceCheckUtils]: 14: Hoare triple {3488#(<= (+ main_~x~0 50) |main_#t~post1|)} ~y~0 := 1 + #t~post1; {3489#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:15,108 INFO L280 TraceCheckUtils]: 15: Hoare triple {3489#(<= (+ main_~x~0 51) main_~y~0)} havoc #t~post1; {3489#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:15,109 INFO L280 TraceCheckUtils]: 16: Hoare triple {3489#(<= (+ main_~x~0 51) main_~y~0)} assume !!(~x~0 < 0); {3489#(<= (+ main_~x~0 51) main_~y~0)} is VALID [2020-07-10 20:25:15,109 INFO L280 TraceCheckUtils]: 17: Hoare triple {3489#(<= (+ main_~x~0 51) main_~y~0)} ~x~0 := ~x~0 + ~y~0; {3490#(<= (+ main_~x~0 51) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:15,110 INFO L280 TraceCheckUtils]: 18: Hoare triple {3490#(<= (+ main_~x~0 51) (* 2 main_~y~0))} #t~post1 := ~y~0; {3491#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,111 INFO L280 TraceCheckUtils]: 19: Hoare triple {3491#(<= (+ main_~x~0 51) (* 2 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:15,111 INFO L280 TraceCheckUtils]: 20: Hoare triple {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} havoc #t~post1; {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:15,111 INFO L280 TraceCheckUtils]: 21: Hoare triple {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} assume !!(~x~0 < 0); {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} is VALID [2020-07-10 20:25:15,112 INFO L280 TraceCheckUtils]: 22: Hoare triple {3492#(<= (+ main_~x~0 53) (* 2 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3493#(<= (+ main_~x~0 53) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:15,113 INFO L280 TraceCheckUtils]: 23: Hoare triple {3493#(<= (+ main_~x~0 53) (* 3 main_~y~0))} #t~post1 := ~y~0; {3494#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,113 INFO L280 TraceCheckUtils]: 24: Hoare triple {3494#(<= (+ main_~x~0 53) (* 3 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:15,114 INFO L280 TraceCheckUtils]: 25: Hoare triple {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} havoc #t~post1; {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:15,114 INFO L280 TraceCheckUtils]: 26: Hoare triple {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} assume !!(~x~0 < 0); {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} is VALID [2020-07-10 20:25:15,115 INFO L280 TraceCheckUtils]: 27: Hoare triple {3495#(<= (+ main_~x~0 56) (* 3 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3496#(<= (+ main_~x~0 56) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:15,115 INFO L280 TraceCheckUtils]: 28: Hoare triple {3496#(<= (+ main_~x~0 56) (* 4 main_~y~0))} #t~post1 := ~y~0; {3497#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,116 INFO L280 TraceCheckUtils]: 29: Hoare triple {3497#(<= (+ main_~x~0 56) (* 4 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:15,116 INFO L280 TraceCheckUtils]: 30: Hoare triple {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} havoc #t~post1; {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:15,117 INFO L280 TraceCheckUtils]: 31: Hoare triple {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} assume !!(~x~0 < 0); {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} is VALID [2020-07-10 20:25:15,117 INFO L280 TraceCheckUtils]: 32: Hoare triple {3498#(<= (+ main_~x~0 60) (* 4 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3499#(<= (+ main_~x~0 60) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:15,118 INFO L280 TraceCheckUtils]: 33: Hoare triple {3499#(<= (+ main_~x~0 60) (* 5 main_~y~0))} #t~post1 := ~y~0; {3500#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,119 INFO L280 TraceCheckUtils]: 34: Hoare triple {3500#(<= (+ main_~x~0 60) (* 5 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:15,119 INFO L280 TraceCheckUtils]: 35: Hoare triple {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} havoc #t~post1; {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:15,119 INFO L280 TraceCheckUtils]: 36: Hoare triple {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} assume !!(~x~0 < 0); {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} is VALID [2020-07-10 20:25:15,120 INFO L280 TraceCheckUtils]: 37: Hoare triple {3501#(<= (+ main_~x~0 65) (* 5 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3502#(<= (+ main_~x~0 65) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:15,121 INFO L280 TraceCheckUtils]: 38: Hoare triple {3502#(<= (+ main_~x~0 65) (* 6 main_~y~0))} #t~post1 := ~y~0; {3503#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,121 INFO L280 TraceCheckUtils]: 39: Hoare triple {3503#(<= (+ main_~x~0 65) (* 6 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:15,122 INFO L280 TraceCheckUtils]: 40: Hoare triple {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} havoc #t~post1; {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:15,122 INFO L280 TraceCheckUtils]: 41: Hoare triple {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} assume !!(~x~0 < 0); {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} is VALID [2020-07-10 20:25:15,123 INFO L280 TraceCheckUtils]: 42: Hoare triple {3504#(<= (+ main_~x~0 71) (* 6 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3505#(<= (+ main_~x~0 71) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:15,123 INFO L280 TraceCheckUtils]: 43: Hoare triple {3505#(<= (+ main_~x~0 71) (* 7 main_~y~0))} #t~post1 := ~y~0; {3506#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,125 INFO L280 TraceCheckUtils]: 44: Hoare triple {3506#(<= (+ main_~x~0 71) (* 7 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:15,129 INFO L280 TraceCheckUtils]: 45: Hoare triple {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} havoc #t~post1; {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:15,130 INFO L280 TraceCheckUtils]: 46: Hoare triple {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} assume !!(~x~0 < 0); {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} is VALID [2020-07-10 20:25:15,131 INFO L280 TraceCheckUtils]: 47: Hoare triple {3507#(<= (+ main_~x~0 78) (* 7 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3508#(<= (+ main_~x~0 78) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:15,131 INFO L280 TraceCheckUtils]: 48: Hoare triple {3508#(<= (+ main_~x~0 78) (* 8 main_~y~0))} #t~post1 := ~y~0; {3509#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,132 INFO L280 TraceCheckUtils]: 49: Hoare triple {3509#(<= (+ main_~x~0 78) (* 8 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:15,132 INFO L280 TraceCheckUtils]: 50: Hoare triple {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} havoc #t~post1; {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:15,133 INFO L280 TraceCheckUtils]: 51: Hoare triple {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} assume !!(~x~0 < 0); {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} is VALID [2020-07-10 20:25:15,133 INFO L280 TraceCheckUtils]: 52: Hoare triple {3510#(<= (+ main_~x~0 86) (* 8 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3511#(<= (+ main_~x~0 86) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:15,134 INFO L280 TraceCheckUtils]: 53: Hoare triple {3511#(<= (+ main_~x~0 86) (* 9 main_~y~0))} #t~post1 := ~y~0; {3512#(<= (+ main_~x~0 86) (* 9 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,134 INFO L280 TraceCheckUtils]: 54: Hoare triple {3512#(<= (+ main_~x~0 86) (* 9 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:15,135 INFO L280 TraceCheckUtils]: 55: Hoare triple {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} havoc #t~post1; {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:15,135 INFO L280 TraceCheckUtils]: 56: Hoare triple {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} assume !!(~x~0 < 0); {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} is VALID [2020-07-10 20:25:15,136 INFO L280 TraceCheckUtils]: 57: Hoare triple {3513#(<= (+ main_~x~0 95) (* 9 main_~y~0))} ~x~0 := ~x~0 + ~y~0; {3514#(<= (+ main_~x~0 95) (* 10 main_~y~0))} is VALID [2020-07-10 20:25:15,136 INFO L280 TraceCheckUtils]: 58: Hoare triple {3514#(<= (+ main_~x~0 95) (* 10 main_~y~0))} #t~post1 := ~y~0; {3515#(<= (+ main_~x~0 95) (* 10 |main_#t~post1|))} is VALID [2020-07-10 20:25:15,137 INFO L280 TraceCheckUtils]: 59: Hoare triple {3515#(<= (+ main_~x~0 95) (* 10 |main_#t~post1|))} ~y~0 := 1 + #t~post1; {3516#(<= (+ main_~x~0 105) (* 10 main_~y~0))} is VALID [2020-07-10 20:25:15,137 INFO L280 TraceCheckUtils]: 60: Hoare triple {3516#(<= (+ main_~x~0 105) (* 10 main_~y~0))} havoc #t~post1; {3516#(<= (+ main_~x~0 105) (* 10 main_~y~0))} is VALID [2020-07-10 20:25:15,138 INFO L280 TraceCheckUtils]: 61: Hoare triple {3516#(<= (+ main_~x~0 105) (* 10 main_~y~0))} assume !(~x~0 < 0); {3517#(<= 11 main_~y~0)} is VALID [2020-07-10 20:25:15,139 INFO L263 TraceCheckUtils]: 62: Hoare triple {3517#(<= 11 main_~y~0)} call __VERIFIER_assert((if ~y~0 > 0 then 1 else 0)); {3518#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-10 20:25:15,139 INFO L280 TraceCheckUtils]: 63: Hoare triple {3518#(not (= 0 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {3519#(not (= 0 __VERIFIER_assert_~cond))} is VALID [2020-07-10 20:25:15,139 INFO L280 TraceCheckUtils]: 64: Hoare triple {3519#(not (= 0 __VERIFIER_assert_~cond))} assume 0 == ~cond; {3483#false} is VALID [2020-07-10 20:25:15,140 INFO L280 TraceCheckUtils]: 65: Hoare triple {3483#false} assume !false; {3483#false} is VALID [2020-07-10 20:25:15,145 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-10 20:25:15,145 INFO L185 leratedInterpolation]: Finished Analysing Program using PRECISE loop Acceleration [2020-07-10 20:25:15,146 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1311212375] [2020-07-10 20:25:15,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 20:25:15,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2020-07-10 20:25:15,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212834225] [2020-07-10 20:25:15,147 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2020-07-10 20:25:15,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 20:25:15,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 36 states. [2020-07-10 20:25:15,234 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:15,234 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2020-07-10 20:25:15,234 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-07-10 20:25:15,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2020-07-10 20:25:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1181, Unknown=0, NotChecked=0, Total=1260 [2020-07-10 20:25:15,236 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 36 states. [2020-07-10 20:25:19,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,071 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2020-07-10 20:25:19,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2020-07-10 20:25:19,071 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 66 [2020-07-10 20:25:19,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 20:25:19,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:25:19,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2020-07-10 20:25:19,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-10 20:25:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2020-07-10 20:25:19,076 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 51 states and 68 transitions. [2020-07-10 20:25:19,165 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:19,166 INFO L225 Difference]: With dead ends: 68 [2020-07-10 20:25:19,166 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 20:25:19,168 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=221, Invalid=3685, Unknown=0, NotChecked=0, Total=3906 [2020-07-10 20:25:19,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 20:25:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 20:25:19,168 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 20:25:19,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:19,169 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:19,169 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:19,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,169 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:19,169 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:19,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:19,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:19,170 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:19,170 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 20:25:19,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 20:25:19,170 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 20:25:19,170 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:19,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:19,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 20:25:19,171 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 20:25:19,171 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 20:25:19,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 20:25:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 20:25:19,171 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 66 [2020-07-10 20:25:19,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 20:25:19,171 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 20:25:19,171 INFO L480 AbstractCegarLoop]: Interpolant automaton has 36 states. [2020-07-10 20:25:19,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2020-07-10 20:25:19,172 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 20:25:19,172 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 20:25:19,172 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 20:25:19,172 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-07-10 20:25:19,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 20:25:19,839 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-07-10 20:25:19,840 INFO L268 CegarLoopResult]: For program point L4-3(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:19,840 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:19,840 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed. [2020-07-10 20:25:19,840 INFO L268 CegarLoopResult]: For program point L4-1(line 4) no Hoare annotation was computed. [2020-07-10 20:25:19,840 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed. [2020-07-10 20:25:19,840 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 13 24) the Hoare annotation is: true [2020-07-10 20:25:19,841 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse2 (+ main_~x~0 65)) (.cse1 (* 6 main_~y~0))) (let ((.cse0 (<= .cse2 .cse1))) (or (and .cse0 (<= (+ main_~x~0 86) (* 8 main_~y~0))) (<= (+ main_~x~0 71) .cse1) (<= (+ main_~x~0 50) 0) (<= .cse2 (* 5 main_~y~0)) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (<= (+ main_~x~0 51) main_~y~0) (and (<= (+ main_~x~0 95) (* 9 main_~y~0)) .cse0)))) [2020-07-10 20:25:19,841 INFO L264 CegarLoopResult]: At program point L17(line 17) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-07-10 20:25:19,841 INFO L271 CegarLoopResult]: At program point L17-1(line 17) the Hoare annotation is: true [2020-07-10 20:25:19,841 INFO L271 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: true [2020-07-10 20:25:19,841 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 13 24) the Hoare annotation is: true [2020-07-10 20:25:19,841 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 24) the Hoare annotation is: true [2020-07-10 20:25:19,842 INFO L271 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: true [2020-07-10 20:25:19,842 INFO L264 CegarLoopResult]: At program point L20(line 20) the Hoare annotation is: (or (<= (+ main_~x~0 50) main_~y~0) (<= (+ main_~x~0 78) (* 8 main_~y~0)) (<= (+ main_~x~0 56) (* 4 main_~y~0)) (<= (+ main_~x~0 51) (* 2 main_~y~0)) (<= (+ main_~x~0 65) (* 6 main_~y~0)) (<= (+ main_~x~0 95) (* 10 main_~y~0))) [2020-07-10 20:25:19,842 INFO L264 CegarLoopResult]: At program point L20-1(line 20) the Hoare annotation is: (or (let ((.cse0 (+ main_~x~0 50))) (and (<= .cse0 main_~y~0) (<= .cse0 |main_#t~post1|))) (let ((.cse1 (+ main_~x~0 95))) (and (<= .cse1 (* 10 |main_#t~post1|)) (<= .cse1 (* 10 main_~y~0)))) (let ((.cse2 (+ main_~x~0 60))) (and (<= .cse2 (* 5 main_~y~0)) (<= .cse2 (* 5 |main_#t~post1|)))) (let ((.cse3 (+ main_~x~0 53))) (and (<= .cse3 (* 3 main_~y~0)) (<= .cse3 (* 3 |main_#t~post1|)))) (let ((.cse4 (+ main_~x~0 78))) (and (<= .cse4 (* 8 |main_#t~post1|)) (<= .cse4 (* 8 main_~y~0)))) (let ((.cse5 (+ main_~x~0 71))) (and (<= .cse5 (* 7 main_~y~0)) (<= .cse5 (* 7 |main_#t~post1|))))) [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L20-2(line 20) the Hoare annotation is: (let ((.cse0 (+ main_~x~0 51))) (or (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= (+ main_~x~0 95) (* 10 |main_#t~post1|))) (and (<= (+ main_~x~0 50) |main_#t~post1|) (<= .cse0 main_~y~0)) (and (<= (+ main_~x~0 60) (* 4 main_~y~0)) (<= (+ main_~x~0 56) (* 4 |main_#t~post1|))) (and (<= (+ main_~x~0 53) (* 2 main_~y~0)) (<= .cse0 (* 2 |main_#t~post1|))) (and (<= (+ main_~x~0 71) (* 6 main_~y~0)) (<= (+ main_~x~0 65) (* 6 |main_#t~post1|))) (and (<= (+ main_~x~0 78) (* 8 |main_#t~post1|)) (<= (+ main_~x~0 86) (* 8 main_~y~0))))) [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L16(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 21) the Hoare annotation is: (or (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= (+ main_~x~0 78) (* 7 main_~y~0)) (<= (+ main_~x~0 50) 0) (<= (+ main_~x~0 65) (* 5 main_~y~0)) (<= (+ main_~x~0 86) (* 8 main_~y~0)) (<= (+ main_~x~0 56) (* 3 main_~y~0)) (<= (+ main_~x~0 51) main_~y~0)) [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L16-1(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L18-3(lines 18 21) the Hoare annotation is: (and (<= (+ main_~x~0 105) (* 10 main_~y~0)) (<= 11 main_~y~0)) [2020-07-10 20:25:19,843 INFO L271 CegarLoopResult]: At program point L14(line 14) the Hoare annotation is: true [2020-07-10 20:25:19,843 INFO L264 CegarLoopResult]: At program point L16-2(line 16) the Hoare annotation is: (<= (+ main_~x~0 50) 0) [2020-07-10 20:25:19,844 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:19,844 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:19,844 INFO L264 CegarLoopResult]: At program point L8(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:19,844 INFO L264 CegarLoopResult]: At program point L7(lines 7 9) the Hoare annotation is: (or (= 0 |__VERIFIER_assert_#in~cond|) (not (= 0 __VERIFIER_assert_~cond))) [2020-07-10 20:25:19,844 INFO L271 CegarLoopResult]: At program point L7-2(lines 6 11) the Hoare annotation is: true [2020-07-10 20:25:19,844 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) the Hoare annotation is: (= 0 |__VERIFIER_assert_#in~cond|) [2020-07-10 20:25:19,848 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-10 20:25:19,849 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:19,849 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation [2020-07-10 20:25:19,849 WARN L170 areAnnotationChecker]: L4-1 has no Hoare annotation [2020-07-10 20:25:19,849 WARN L170 areAnnotationChecker]: L4-3 has no Hoare annotation [2020-07-10 20:25:19,863 INFO L163 areAnnotationChecker]: CFG has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 20:25:19,875 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 08:25:19 BoogieIcfgContainer [2020-07-10 20:25:19,876 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 20:25:19,879 INFO L168 Benchmark]: Toolchain (without parser) took 28777.11 ms. Allocated memory was 138.4 MB in the beginning and 379.1 MB in the end (delta: 240.6 MB). Free memory was 103.9 MB in the beginning and 127.7 MB in the end (delta: -23.7 MB). Peak memory consumption was 216.9 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,879 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,880 INFO L168 Benchmark]: CACSL2BoogieTranslator took 270.72 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 94.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,881 INFO L168 Benchmark]: Boogie Preprocessor took 33.63 ms. Allocated memory is still 138.4 MB. Free memory was 94.2 MB in the beginning and 92.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,881 INFO L168 Benchmark]: RCFGBuilder took 424.66 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 164.4 MB in the end (delta: -71.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,882 INFO L168 Benchmark]: TraceAbstraction took 28042.06 ms. Allocated memory was 202.4 MB in the beginning and 379.1 MB in the end (delta: 176.7 MB). Free memory was 163.7 MB in the beginning and 127.7 MB in the end (delta: 36.1 MB). Peak memory consumption was 212.8 MB. Max. memory is 7.1 GB. [2020-07-10 20:25:19,885 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 270.72 ms. Allocated memory is still 138.4 MB. Free memory was 103.7 MB in the beginning and 94.2 MB in the end (delta: 9.5 MB). Peak memory consumption was 9.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.63 ms. Allocated memory is still 138.4 MB. Free memory was 94.2 MB in the beginning and 92.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 424.66 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 92.7 MB in the beginning and 164.4 MB in the end (delta: -71.7 MB). Peak memory consumption was 14.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 28042.06 ms. Allocated memory was 202.4 MB in the beginning and 379.1 MB in the end (delta: 176.7 MB). Free memory was 163.7 MB in the beginning and 127.7 MB in the end (delta: 36.1 MB). Peak memory consumption was 212.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 8]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((x + 105 <= 10 * y || x + 78 <= 7 * y) || x + 50 <= 0) || x + 65 <= 5 * y) || x + 86 <= 8 * y) || x + 56 <= 3 * y) || x + 51 <= y - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 6]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 34 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 27.2s, OverallIterations: 12, TraceHistogramMax: 10, AutomataDifference: 19.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 242 SDtfs, 204 SDslu, 2210 SDs, 0 SdLazy, 5571 SolverSat, 136 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 399 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 351 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2709 ImplicationChecksByTransitivity, 7.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=67occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 12 MinimizatonAttempts, 10 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 95 PreInvPairs, 179 NumberOfFragments, 384 HoareAnnotationTreeSize, 95 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 29 FomulaSimplificationsInter, 331 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 correct! Received shutdown request...