/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-8fc6572 [2020-07-10 14:58:40,741 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-10 14:58:40,744 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-10 14:58:40,757 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-10 14:58:40,758 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-10 14:58:40,759 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-10 14:58:40,760 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-10 14:58:40,762 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-10 14:58:40,764 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-10 14:58:40,765 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-10 14:58:40,766 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-10 14:58:40,767 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-10 14:58:40,767 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-10 14:58:40,768 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-10 14:58:40,769 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-10 14:58:40,770 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-10 14:58:40,771 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-10 14:58:40,772 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-10 14:58:40,774 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-10 14:58:40,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-10 14:58:40,778 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-10 14:58:40,779 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-10 14:58:40,780 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-10 14:58:40,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-10 14:58:40,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-10 14:58:40,785 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-10 14:58:40,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-10 14:58:40,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-10 14:58:40,787 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-10 14:58:40,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-10 14:58:40,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-10 14:58:40,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-10 14:58:40,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-10 14:58:40,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-10 14:58:40,792 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-10 14:58:40,792 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-10 14:58:40,793 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-10 14:58:40,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-10 14:58:40,794 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-10 14:58:40,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-10 14:58:40,795 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-10 14:58:40,796 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-10 14:58:40,812 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-10 14:58:40,813 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-10 14:58:40,814 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-10 14:58:40,814 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-10 14:58:40,815 INFO L138 SettingsManager]: * Use SBE=true [2020-07-10 14:58:40,815 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-10 14:58:40,815 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-10 14:58:40,815 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-10 14:58:40,816 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-10 14:58:40,816 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-10 14:58:40,816 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-10 14:58:40,816 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-10 14:58:40,816 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-10 14:58:40,817 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-10 14:58:40,817 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-10 14:58:40,817 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-10 14:58:40,817 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-10 14:58:40,817 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-10 14:58:40,818 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-10 14:58:40,818 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-10 14:58:40,818 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-10 14:58:40,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-10 14:58:40,818 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-10 14:58:40,819 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-10 14:58:40,819 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-10 14:58:40,819 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-10 14:58:40,819 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-10 14:58:40,819 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-10 14:58:40,820 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-10 14:58:40,820 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-10 14:58:41,122 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-10 14:58:41,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-10 14:58:41,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-10 14:58:41,141 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-10 14:58:41,142 INFO L275 PluginConnector]: CDTParser initialized [2020-07-10 14:58:41,143 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-10 14:58:41,212 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabb9140/1138cf79a32443639caf102be82627c0/FLAG9bed78c03 [2020-07-10 14:58:41,679 INFO L306 CDTParser]: Found 1 translation units. [2020-07-10 14:58:41,680 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-10 14:58:41,686 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabb9140/1138cf79a32443639caf102be82627c0/FLAG9bed78c03 [2020-07-10 14:58:42,018 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fabb9140/1138cf79a32443639caf102be82627c0 [2020-07-10 14:58:42,029 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-10 14:58:42,031 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-10 14:58:42,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:42,033 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-10 14:58:42,037 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-10 14:58:42,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b778e39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42, skipping insertion in model container [2020-07-10 14:58:42,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-10 14:58:42,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-10 14:58:42,227 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:42,232 INFO L203 MainTranslator]: Completed pre-run [2020-07-10 14:58:42,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-10 14:58:42,262 INFO L208 MainTranslator]: Completed translation [2020-07-10 14:58:42,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42 WrapperNode [2020-07-10 14:58:42,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-10 14:58:42,263 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-10 14:58:42,263 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-10 14:58:42,263 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-10 14:58:42,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,278 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,283 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,284 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (1/1) ... [2020-07-10 14:58:42,294 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-10 14:58:42,294 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-10 14:58:42,295 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-10 14:58:42,295 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-10 14:58:42,296 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (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 14:58:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-10 14:58:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-10 14:58:42,450 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-10 14:58:42,451 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-10 14:58:42,451 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-10 14:58:42,888 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-10 14:58:42,889 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-10 14:58:42,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:42 BoogieIcfgContainer [2020-07-10 14:58:42,893 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-10 14:58:42,894 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-10 14:58:42,894 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-10 14:58:42,897 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-10 14:58:42,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 02:58:42" (1/3) ... [2020-07-10 14:58:42,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e67bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:42, skipping insertion in model container [2020-07-10 14:58:42,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 02:58:42" (2/3) ... [2020-07-10 14:58:42,899 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468e67bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 02:58:42, skipping insertion in model container [2020-07-10 14:58:42,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 02:58:42" (3/3) ... [2020-07-10 14:58:42,901 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-10 14:58:42,912 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-10 14:58:42,922 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-10 14:58:42,937 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-10 14:58:42,962 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-10 14:58:42,963 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-10 14:58:42,963 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-10 14:58:42,963 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-10 14:58:42,963 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-10 14:58:42,963 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-10 14:58:42,964 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-10 14:58:42,964 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-10 14:58:42,984 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-10 14:58:42,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-10 14:58:42,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:42,992 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:42,993 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:43,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-10 14:58:43,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:43,013 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412036624] [2020-07-10 14:58:43,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:43,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,219 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:43,220 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,256 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:43,258 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:43,259 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:43,261 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:43,262 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-10 14:58:43,262 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-10 14:58:43,262 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-10 14:58:43,263 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-10 14:58:43,263 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {24#true} is VALID [2020-07-10 14:58:43,264 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-10 14:58:43,264 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-10 14:58:43,265 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:43,266 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:43,272 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-10 14:58:43,273 INFO L280 TraceCheckUtils]: 10: Hoare triple {32#(<= |main_#t~ret2| 0)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {33#(<= main_~result~0 0)} is VALID [2020-07-10 14:58:43,275 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 10 == ~result~0; {25#false} is VALID [2020-07-10 14:58:43,275 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-10 14:58:43,277 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 14:58:43,278 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412036624] [2020-07-10 14:58:43,279 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:43,280 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:43,281 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607087667] [2020-07-10 14:58:43,287 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:43,290 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:43,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:43,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:43,372 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:43,372 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:43,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:43,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:43,384 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-10 14:58:43,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:43,575 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-10 14:58:43,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:43,581 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-10 14:58:43,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:43,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:43,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:43,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-10 14:58:43,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-10 14:58:43,692 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 14:58:43,707 INFO L225 Difference]: With dead ends: 33 [2020-07-10 14:58:43,707 INFO L226 Difference]: Without dead ends: 19 [2020-07-10 14:58:43,711 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:43,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-10 14:58:43,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-10 14:58:43,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:43,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:43,760 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:43,761 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:43,768 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:43,768 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:43,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:43,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:43,769 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:43,769 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-10 14:58:43,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:43,774 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-10 14:58:43,775 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:43,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:43,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:43,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:43,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:43,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-10 14:58:43,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-10 14:58:43,781 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-10 14:58:43,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:43,782 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-10 14:58:43,782 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-10 14:58:43,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:43,785 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:43,786 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:43,786 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-10 14:58:43,786 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:43,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:43,787 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-10 14:58:43,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:43,788 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189257193] [2020-07-10 14:58:43,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,878 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:43,878 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:43,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,044 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:44,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,047 INFO L280 TraceCheckUtils]: 2: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,050 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,051 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:44,052 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:44,052 INFO L263 TraceCheckUtils]: 2: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-10 14:58:44,053 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:44,054 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,056 INFO L280 TraceCheckUtils]: 5: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,059 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,061 INFO L280 TraceCheckUtils]: 7: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:44,062 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-10 14:58:44,063 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:44,063 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-10 14:58:44,064 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-10 14:58:44,065 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-10 14:58:44,065 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-10 14:58:44,066 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-10 14:58:44,066 INFO L280 TraceCheckUtils]: 4: Hoare triple {141#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {141#true} is VALID [2020-07-10 14:58:44,066 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-10 14:58:44,067 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:44,067 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-10 14:58:44,067 INFO L263 TraceCheckUtils]: 8: Hoare triple {141#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {141#true} is VALID [2020-07-10 14:58:44,068 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-10 14:58:44,070 INFO L280 TraceCheckUtils]: 10: Hoare triple {141#true} assume 0 == ~x;#res := 0; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,071 INFO L280 TraceCheckUtils]: 11: Hoare triple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,074 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {164#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {141#true} #36#return; {162#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,075 INFO L280 TraceCheckUtils]: 13: Hoare triple {162#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {163#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:44,077 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-10 14:58:44,077 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-10 14:58:44,078 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-10 14:58:44,079 INFO L280 TraceCheckUtils]: 17: Hoare triple {156#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {157#(<= main_~result~0 5)} is VALID [2020-07-10 14:58:44,081 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= main_~result~0 5)} assume 10 == ~result~0; {142#false} is VALID [2020-07-10 14:58:44,081 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-10 14:58:44,083 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:44,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189257193] [2020-07-10 14:58:44,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:44,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-10 14:58:44,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887233347] [2020-07-10 14:58:44,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:44,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:44,088 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-10 14:58:44,156 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:44,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-10 14:58:44,157 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:44,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-10 14:58:44,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:44,158 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-10 14:58:44,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:44,388 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-10 14:58:44,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:44,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-10 14:58:44,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:44,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:44,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:44,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-10 14:58:44,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-10 14:58:44,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-10 14:58:44,464 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 14:58:44,467 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:58:44,467 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:44,471 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-10 14:58:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:44,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-10 14:58:44,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:44,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:44,488 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:44,488 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-10 14:58:44,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:44,493 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:44,493 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:44,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:44,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:44,494 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:44,494 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-10 14:58:44,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:44,498 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-10 14:58:44,498 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-10 14:58:44,499 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:44,499 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:44,499 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:44,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-10 14:58:44,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-10 14:58:44,503 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-10 14:58:44,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:44,503 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-10 14:58:44,503 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-10 14:58:44,503 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-10 14:58:44,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-10 14:58:44,504 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:44,505 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:44,505 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-10 14:58:44,505 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:44,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:44,506 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-10 14:58:44,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:44,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508547516] [2020-07-10 14:58:44,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,578 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:44,578 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:44,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,702 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,703 INFO L280 TraceCheckUtils]: 2: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,704 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,705 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,705 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:44,706 INFO L263 TraceCheckUtils]: 2: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:44,706 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,707 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,708 INFO L280 TraceCheckUtils]: 5: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,709 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,711 INFO L280 TraceCheckUtils]: 7: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:44,712 INFO L280 TraceCheckUtils]: 8: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,715 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:44,716 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:44,716 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:44,716 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:44,716 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:44,717 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-10 14:58:44,717 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:44,717 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:44,717 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:44,718 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,719 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,721 INFO L280 TraceCheckUtils]: 11: Hoare triple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:44,724 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {303#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {279#true} #36#return; {300#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:44,726 INFO L280 TraceCheckUtils]: 13: Hoare triple {300#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:44,727 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,728 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,730 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:44,731 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-10 14:58:44,733 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-10 14:58:44,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:44,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508547516] [2020-07-10 14:58:44,735 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69768088] [2020-07-10 14:58:44,735 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:44,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,772 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:58:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:44,790 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:44,940 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-10 14:58:44,941 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-10 14:58:44,941 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-10 14:58:44,941 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-10 14:58:44,942 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {279#true} is VALID [2020-07-10 14:58:44,942 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-10 14:58:44,942 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,943 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-10 14:58:44,943 INFO L263 TraceCheckUtils]: 8: Hoare triple {279#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {279#true} is VALID [2020-07-10 14:58:44,943 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-10 14:58:44,944 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:44,945 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:44,947 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:44,948 INFO L280 TraceCheckUtils]: 13: Hoare triple {344#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {301#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:44,949 INFO L280 TraceCheckUtils]: 14: Hoare triple {301#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,949 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:44,951 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-10 14:58:44,952 INFO L280 TraceCheckUtils]: 17: Hoare triple {294#(<= |main_#t~ret2| 1)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {295#(<= main_~result~0 1)} is VALID [2020-07-10 14:58:44,953 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-10 14:58:44,954 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-10 14:58:44,955 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-10 14:58:44,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:44,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:44,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076755377] [2020-07-10 14:58:44,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:44,958 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:44,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:44,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:44,995 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:44,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:44,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:44,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:44,996 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-10 14:58:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:45,199 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:45,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:45,200 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-10 14:58:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:45,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:45,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-10 14:58:45,206 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-10 14:58:45,256 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:45,258 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:58:45,258 INFO L226 Difference]: Without dead ends: 23 [2020-07-10 14:58:45,259 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:45,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-10 14:58:45,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-10 14:58:45,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:45,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:45,269 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:45,269 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:45,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:45,272 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:45,272 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:45,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:45,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:45,274 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:45,274 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-10 14:58:45,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:45,277 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-10 14:58:45,277 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:45,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:45,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:45,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:45,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:45,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-10 14:58:45,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-10 14:58:45,281 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-10 14:58:45,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:45,282 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-10 14:58:45,282 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-10 14:58:45,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:45,284 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:45,284 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:45,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-10 14:58:45,501 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:45,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:45,502 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-10 14:58:45,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:45,503 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524298472] [2020-07-10 14:58:45,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:45,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,574 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:45,575 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:45,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,733 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,734 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,735 INFO L280 TraceCheckUtils]: 2: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,737 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:45,738 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,739 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,739 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,739 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,740 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,741 INFO L280 TraceCheckUtils]: 5: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,743 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:45,744 INFO L280 TraceCheckUtils]: 7: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:45,745 INFO L280 TraceCheckUtils]: 8: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,746 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,747 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:45,748 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,748 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,748 INFO L263 TraceCheckUtils]: 2: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,749 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,749 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,749 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,749 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,751 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,752 INFO L280 TraceCheckUtils]: 8: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,754 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:45,755 INFO L280 TraceCheckUtils]: 10: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:45,756 INFO L280 TraceCheckUtils]: 11: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,757 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,759 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:45,760 INFO L280 TraceCheckUtils]: 14: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:45,761 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-10 14:58:45,761 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:45,762 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:45,763 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:45,763 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:45,763 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:45,763 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:45,764 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-10 14:58:45,764 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:45,764 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,765 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,765 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,765 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,765 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,766 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,766 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,767 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,768 INFO L280 TraceCheckUtils]: 14: Hoare triple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:45,770 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {519#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {477#true} #36#return; {516#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:45,771 INFO L280 TraceCheckUtils]: 16: Hoare triple {516#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:45,772 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,773 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,775 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:45,776 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:45,777 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-10 14:58:45,777 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:45,778 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:45,778 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-10 14:58:45,778 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-10 14:58:45,778 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:45,780 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524298472] [2020-07-10 14:58:45,781 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641359425] [2020-07-10 14:58:45,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:45,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,823 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-10 14:58:45,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:45,833 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:45,932 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-10 14:58:45,932 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-10 14:58:45,933 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-10 14:58:45,933 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-10 14:58:45,933 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {477#true} is VALID [2020-07-10 14:58:45,934 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-10 14:58:45,934 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,934 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,934 INFO L263 TraceCheckUtils]: 8: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,935 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,935 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-10 14:58:45,935 INFO L263 TraceCheckUtils]: 11: Hoare triple {477#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {477#true} is VALID [2020-07-10 14:58:45,935 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-10 14:58:45,937 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:45,937 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:45,939 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:45,940 INFO L280 TraceCheckUtils]: 16: Hoare triple {569#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {517#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:45,941 INFO L280 TraceCheckUtils]: 17: Hoare triple {517#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,941 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:45,943 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:45,944 INFO L280 TraceCheckUtils]: 20: Hoare triple {510#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {511#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:45,945 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-10 14:58:45,945 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-10 14:58:45,945 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-10 14:58:45,946 INFO L280 TraceCheckUtils]: 24: Hoare triple {478#false} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {478#false} is VALID [2020-07-10 14:58:45,946 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-10 14:58:45,946 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-10 14:58:45,948 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:45,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:45,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-10 14:58:45,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957116879] [2020-07-10 14:58:45,949 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:45,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:45,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-10 14:58:45,986 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 14:58:45,986 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-10 14:58:45,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:45,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-10 14:58:45,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-10 14:58:45,988 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-10 14:58:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:46,173 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-10 14:58:46,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-10 14:58:46,174 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-10 14:58:46,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:46,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:46,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:46,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-10 14:58:46,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-10 14:58:46,185 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-10 14:58:46,254 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:46,257 INFO L225 Difference]: With dead ends: 35 [2020-07-10 14:58:46,257 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:58:46,258 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-07-10 14:58:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:58:46,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-10 14:58:46,274 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:46,274 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:46,274 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:46,274 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-10 14:58:46,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:46,278 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:46,278 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:46,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:46,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:46,279 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:46,279 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-10 14:58:46,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:46,282 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-10 14:58:46,282 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-10 14:58:46,283 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:46,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:46,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:46,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:46,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-10 14:58:46,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-10 14:58:46,286 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-10 14:58:46,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:46,287 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-10 14:58:46,287 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-10 14:58:46,287 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-10 14:58:46,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-10 14:58:46,288 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:46,288 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:46,503 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:46,504 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:46,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:46,505 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-10 14:58:46,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:46,506 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802982325] [2020-07-10 14:58:46,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,592 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:46,593 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,809 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,810 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,811 INFO L280 TraceCheckUtils]: 2: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,812 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:46,813 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,813 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:46,813 INFO L263 TraceCheckUtils]: 2: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:46,813 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,814 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,815 INFO L280 TraceCheckUtils]: 5: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,817 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:46,819 INFO L280 TraceCheckUtils]: 7: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:46,820 INFO L280 TraceCheckUtils]: 8: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,821 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,823 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:46,824 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,824 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:46,824 INFO L263 TraceCheckUtils]: 2: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:46,825 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,825 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:46,825 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:46,825 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,826 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,828 INFO L280 TraceCheckUtils]: 8: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,830 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:46,832 INFO L280 TraceCheckUtils]: 10: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:46,832 INFO L280 TraceCheckUtils]: 11: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,833 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,835 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:46,836 INFO L280 TraceCheckUtils]: 14: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:46,837 INFO L280 TraceCheckUtils]: 15: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:46,837 INFO L280 TraceCheckUtils]: 16: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:46,841 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:46,842 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-10 14:58:46,842 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:46,843 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:46,843 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-10 14:58:46,843 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {732#true} is VALID [2020-07-10 14:58:46,844 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-10 14:58:46,844 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,844 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:46,844 INFO L263 TraceCheckUtils]: 8: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:46,845 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,845 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:46,845 INFO L263 TraceCheckUtils]: 11: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:46,856 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:46,861 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,862 INFO L280 TraceCheckUtils]: 14: Hoare triple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} assume true; {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} is VALID [2020-07-10 14:58:46,864 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {777#(and (<= |id_#res| 0) (<= 0 |id_#res|))} {732#true} #36#return; {774#(= 0 |id_#t~ret0|)} is VALID [2020-07-10 14:58:46,866 INFO L280 TraceCheckUtils]: 16: Hoare triple {774#(= 0 |id_#t~ret0|)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:46,867 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,868 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:46,869 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:46,870 INFO L280 TraceCheckUtils]: 20: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:46,871 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:46,872 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:46,873 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:46,874 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {755#(<= main_~result~0 2)} is VALID [2020-07-10 14:58:46,875 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-10 14:58:46,875 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-10 14:58:46,877 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:46,877 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802982325] [2020-07-10 14:58:46,878 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499951697] [2020-07-10 14:58:46,878 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:46,916 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-10 14:58:46,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-10 14:58:46,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-10 14:58:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:46,927 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-10 14:58:47,048 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-10 14:58:47,048 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-10 14:58:47,049 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-10 14:58:47,049 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-10 14:58:47,049 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {732#true} is VALID [2020-07-10 14:58:47,049 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-10 14:58:47,050 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:47,050 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:47,050 INFO L263 TraceCheckUtils]: 8: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:47,050 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:47,051 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-10 14:58:47,051 INFO L263 TraceCheckUtils]: 11: Hoare triple {732#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {732#true} is VALID [2020-07-10 14:58:47,051 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-10 14:58:47,052 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {820#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:47,053 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= |id_#res| 0)} assume true; {820#(<= |id_#res| 0)} is VALID [2020-07-10 14:58:47,054 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {820#(<= |id_#res| 0)} {732#true} #36#return; {827#(<= |id_#t~ret0| 0)} is VALID [2020-07-10 14:58:47,055 INFO L280 TraceCheckUtils]: 16: Hoare triple {827#(<= |id_#t~ret0| 0)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {775#(<= id_~ret~0 1)} is VALID [2020-07-10 14:58:47,056 INFO L280 TraceCheckUtils]: 17: Hoare triple {775#(<= id_~ret~0 1)} assume !(~ret~0 > 5);#res := ~ret~0; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:47,056 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-10 14:58:47,058 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-10 14:58:47,059 INFO L280 TraceCheckUtils]: 20: Hoare triple {767#(<= |id_#t~ret0| 1)} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {768#(<= id_~ret~0 2)} is VALID [2020-07-10 14:58:47,059 INFO L280 TraceCheckUtils]: 21: Hoare triple {768#(<= id_~ret~0 2)} assume !(~ret~0 > 5);#res := ~ret~0; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:47,060 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-10 14:58:47,061 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-10 14:58:47,062 INFO L280 TraceCheckUtils]: 24: Hoare triple {754#(<= |main_#t~ret2| 2)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {755#(<= main_~result~0 2)} is VALID [2020-07-10 14:58:47,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-10 14:58:47,063 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-10 14:58:47,064 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-10 14:58:47,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-10 14:58:47,064 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-07-10 14:58:47,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882944223] [2020-07-10 14:58:47,065 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-10 14:58:47,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:47,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-10 14:58:47,099 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 14:58:47,099 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-10 14:58:47,100 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:47,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-10 14:58:47,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-10 14:58:47,100 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-10 14:58:47,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,318 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-10 14:58:47,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-10 14:58:47,319 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-10 14:58:47,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:47,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-10 14:58:47,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-10 14:58:47,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-10 14:58:47,325 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-10 14:58:47,378 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 14:58:47,379 INFO L225 Difference]: With dead ends: 31 [2020-07-10 14:58:47,380 INFO L226 Difference]: Without dead ends: 27 [2020-07-10 14:58:47,380 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=166, Unknown=0, NotChecked=0, Total=210 [2020-07-10 14:58:47,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-10 14:58:47,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-10 14:58:47,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:47,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:47,388 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:47,388 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:47,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,390 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:47,391 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:47,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:47,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:47,392 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:47,392 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-10 14:58:47,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,394 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:47,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:47,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:47,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:47,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:47,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:47,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-10 14:58:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-10 14:58:47,398 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2020-07-10 14:58:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:47,398 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-10 14:58:47,398 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-10 14:58:47,398 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-10 14:58:47,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-10 14:58:47,399 INFO L414 BasicCegarLoop]: Found error trace [2020-07-10 14:58:47,400 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-10 14:58:47,605 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-10 14:58:47,606 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-10 14:58:47,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-10 14:58:47,609 INFO L82 PathProgramCache]: Analyzing trace with hash -645661089, now seen corresponding path program 2 times [2020-07-10 14:58:47,609 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-10 14:58:47,610 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819491062] [2020-07-10 14:58:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-10 14:58:47,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,651 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,652 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-10 14:58:47,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-10 14:58:47,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:47,711 INFO L280 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,711 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,712 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,712 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,712 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,713 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:47,713 INFO L280 TraceCheckUtils]: 5: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,713 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,714 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,714 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,715 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,715 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,715 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,716 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,716 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,716 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,716 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,717 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:47,717 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,717 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,718 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,718 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,718 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,718 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,719 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,719 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,719 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,719 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,720 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,720 INFO L263 TraceCheckUtils]: 2: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,721 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,721 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,721 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,722 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,722 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,722 INFO L263 TraceCheckUtils]: 8: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,722 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,723 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:47,723 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,723 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,723 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,723 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,724 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,724 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,724 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,724 INFO L280 TraceCheckUtils]: 18: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,725 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,725 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,725 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,726 INFO L280 TraceCheckUtils]: 22: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-10 14:58:47,727 INFO L280 TraceCheckUtils]: 23: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-10 14:58:47,728 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-10 14:58:47,728 INFO L263 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2020-07-10 14:58:47,729 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,729 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-10 14:58:47,729 INFO L263 TraceCheckUtils]: 3: Hoare triple {990#true} call #t~ret3 := main(); {990#true} is VALID [2020-07-10 14:58:47,729 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~input~0 := #t~nondet1;havoc #t~nondet1; {990#true} is VALID [2020-07-10 14:58:47,730 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret2 := id(~input~0); {990#true} is VALID [2020-07-10 14:58:47,730 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,730 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,730 INFO L263 TraceCheckUtils]: 8: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,731 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,731 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,731 INFO L263 TraceCheckUtils]: 11: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,731 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,732 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-10 14:58:47,732 INFO L263 TraceCheckUtils]: 14: Hoare triple {990#true} call #t~ret0 := id((if (~x - 1) % 4294967296 % 4294967296 <= 2147483647 then (~x - 1) % 4294967296 % 4294967296 else (~x - 1) % 4294967296 % 4294967296 - 4294967296)); {990#true} is VALID [2020-07-10 14:58:47,732 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-10 14:58:47,732 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-10 14:58:47,732 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,733 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,733 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,733 INFO L280 TraceCheckUtils]: 20: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,733 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,734 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,734 INFO L280 TraceCheckUtils]: 23: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,734 INFO L280 TraceCheckUtils]: 24: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-10 14:58:47,735 INFO L280 TraceCheckUtils]: 25: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-10 14:58:47,735 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-10 14:58:47,735 INFO L280 TraceCheckUtils]: 27: Hoare triple {990#true} assume -2147483648 <= #t~ret0 && #t~ret0 <= 2147483647;~ret~0 := 1 + #t~ret0;havoc #t~ret0; {990#true} is VALID [2020-07-10 14:58:47,736 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-10 14:58:47,737 INFO L280 TraceCheckUtils]: 29: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-10 14:58:47,738 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-10 14:58:47,739 INFO L280 TraceCheckUtils]: 31: Hoare triple {1019#(<= |main_#t~ret2| 5)} assume -2147483648 <= #t~ret2 && #t~ret2 <= 2147483647;~result~0 := #t~ret2;havoc #t~ret2; {1020#(<= main_~result~0 5)} is VALID [2020-07-10 14:58:47,739 INFO L280 TraceCheckUtils]: 32: Hoare triple {1020#(<= main_~result~0 5)} assume 10 == ~result~0; {991#false} is VALID [2020-07-10 14:58:47,740 INFO L280 TraceCheckUtils]: 33: Hoare triple {991#false} assume !false; {991#false} is VALID [2020-07-10 14:58:47,741 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-07-10 14:58:47,741 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819491062] [2020-07-10 14:58:47,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-10 14:58:47,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-10 14:58:47,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553212460] [2020-07-10 14:58:47,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 14:58:47,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-10 14:58:47,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-10 14:58:47,766 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:47,766 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-10 14:58:47,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-10 14:58:47,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-10 14:58:47,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:47,767 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-10 14:58:47,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,823 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-10 14:58:47,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-10 14:58:47,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-10 14:58:47,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-10 14:58:47,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:47,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 14:58:47,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-10 14:58:47,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-10 14:58:47,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-10 14:58:47,849 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-10 14:58:47,849 INFO L225 Difference]: With dead ends: 27 [2020-07-10 14:58:47,850 INFO L226 Difference]: Without dead ends: 0 [2020-07-10 14:58:47,851 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-10 14:58:47,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-10 14:58:47,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-10 14:58:47,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-10 14:58:47,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:47,852 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:47,852 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:47,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,852 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:47,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:47,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:47,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:47,853 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:47,853 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-10 14:58:47,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-10 14:58:47,854 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-10 14:58:47,865 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:47,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:47,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-10 14:58:47,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-10 14:58:47,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-10 14:58:47,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-10 14:58:47,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-10 14:58:47,866 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-10 14:58:47,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-10 14:58:47,867 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-10 14:58:47,867 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-10 14:58:47,867 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-10 14:58:47,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-10 14:58:47,867 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-10 14:58:47,870 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-10 14:58:47,902 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-10 14:58:47,902 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:47,902 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-10 14:58:47,902 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-10 14:58:47,903 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-10 14:58:47,903 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-10 14:58:47,903 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-10 14:58:47,903 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-10 14:58:47,903 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-10 14:58:47,903 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-10 14:58:47,904 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 17) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-10 14:58:47,904 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-10 14:58:47,905 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-10 14:58:47,905 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-10 14:58:47,905 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-10 14:58:47,905 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-10 14:58:47,910 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:47,911 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:47,911 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-10 14:58:47,911 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:47,911 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:58:47,911 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:47,912 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-10 14:58:47,913 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-10 14:58:47,914 INFO L163 areAnnotationChecker]: CFG has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-10 14:58:47,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 02:58:47 BoogieIcfgContainer [2020-07-10 14:58:47,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-10 14:58:47,920 INFO L168 Benchmark]: Toolchain (without parser) took 5888.72 ms. Allocated memory was 144.7 MB in the beginning and 282.6 MB in the end (delta: 137.9 MB). Free memory was 101.8 MB in the beginning and 249.7 MB in the end (delta: -147.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:58:47,921 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-10 14:58:47,921 INFO L168 Benchmark]: CACSL2BoogieTranslator took 230.11 ms. Allocated memory is still 144.7 MB. Free memory was 101.6 MB in the beginning and 92.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:47,922 INFO L168 Benchmark]: Boogie Preprocessor took 30.96 ms. Allocated memory is still 144.7 MB. Free memory was 92.0 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:47,923 INFO L168 Benchmark]: RCFGBuilder took 598.59 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 166.5 MB in the end (delta: -76.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2020-07-10 14:58:47,924 INFO L168 Benchmark]: TraceAbstraction took 5022.61 ms. Allocated memory was 202.4 MB in the beginning and 282.6 MB in the end (delta: 80.2 MB). Free memory was 166.5 MB in the beginning and 249.7 MB in the end (delta: -83.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-10 14:58:47,926 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 144.7 MB. Free memory was 119.7 MB in the beginning and 119.5 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 230.11 ms. Allocated memory is still 144.7 MB. Free memory was 101.6 MB in the beginning and 92.0 MB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 30.96 ms. Allocated memory is still 144.7 MB. Free memory was 92.0 MB in the beginning and 90.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 598.59 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 90.6 MB in the beginning and 166.5 MB in the end (delta: -76.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 5022.61 ms. Allocated memory was 202.4 MB in the beginning and 282.6 MB in the end (delta: 80.2 MB). Free memory was 166.5 MB in the beginning and 249.7 MB in the end (delta: -83.1 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 4.9s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 111 SDtfs, 16 SDslu, 521 SDs, 0 SdLazy, 113 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 163 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 9 PreInvPairs, 9 NumberOfFragments, 7 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 215 NumberOfCodeBlocks, 215 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 206 ConstructedInterpolants, 0 QuantifiedInterpolants, 9016 SizeOfPredicates, 7 NumberOfNonLiveVariables, 187 ConjunctsInSsa, 24 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 77/105 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...