/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-267fbe0 [2020-07-17 22:21:28,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:21:28,535 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:21:28,555 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:21:28,555 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:21:28,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:21:28,560 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:21:28,570 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:21:28,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:21:28,578 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:21:28,580 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:21:28,582 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:21:28,582 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:21:28,584 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:21:28,586 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:21:28,587 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:21:28,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:21:28,589 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:21:28,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:21:28,596 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:21:28,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:21:28,604 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:21:28,605 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:21:28,606 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:21:28,608 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:21:28,609 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:21:28,609 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:21:28,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:21:28,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:21:28,613 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:21:28,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:21:28,614 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:21:28,615 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:21:28,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:21:28,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:21:28,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:21:28,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:21:28,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:21:28,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:21:28,619 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:21:28,620 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:21:28,621 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-17 22:21:28,658 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:21:28,659 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:21:28,660 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:21:28,663 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:21:28,663 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:21:28,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:21:28,664 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:21:28,664 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:21:28,664 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:21:28,664 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:21:28,664 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:21:28,665 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:21:28,665 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:21:28,665 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:21:28,666 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:21:28,666 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:21:28,667 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:21:28,667 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:21:28,667 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:21:28,667 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:21:28,667 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:21:28,668 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:28,668 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:21:28,668 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:21:28,668 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:21:28,668 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:21:28,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:21:28,669 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:21:28,669 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:21:28,669 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:21:28,959 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:21:28,975 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:21:28,979 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:21:28,981 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:21:28,981 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:21:28,982 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-17 22:21:29,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656c3c82e/df51876bb2e64311b19631c937461b30/FLAG83371a47d [2020-07-17 22:21:29,500 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:21:29,501 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/recursive-simple/id_b5_o10-2.c [2020-07-17 22:21:29,507 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656c3c82e/df51876bb2e64311b19631c937461b30/FLAG83371a47d [2020-07-17 22:21:29,876 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/656c3c82e/df51876bb2e64311b19631c937461b30 [2020-07-17 22:21:29,885 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:21:29,887 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:21:29,888 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:29,888 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:21:29,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:21:29,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:29" (1/1) ... [2020-07-17 22:21:29,896 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dcf5463 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:29, skipping insertion in model container [2020-07-17 22:21:29,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:21:29" (1/1) ... [2020-07-17 22:21:29,904 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:21:29,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:21:30,100 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:30,105 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:21:30,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:21:30,136 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:21:30,137 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30 WrapperNode [2020-07-17 22:21:30,137 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:21:30,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:21:30,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:21:30,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:21:30,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,160 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,163 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,163 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... [2020-07-17 22:21:30,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:21:30,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:21:30,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:21:30,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:21:30,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:21:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:21:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:21:30,305 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2020-07-17 22:21:30,306 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:21:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:21:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:21:30,306 INFO L130 BoogieDeclarations]: Found specification of procedure id [2020-07-17 22:21:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:21:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:21:30,307 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:21:30,580 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:21:30,580 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-07-17 22:21:30,584 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:30 BoogieIcfgContainer [2020-07-17 22:21:30,584 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:21:30,585 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:21:30,585 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:21:30,589 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:21:30,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:21:29" (1/3) ... [2020-07-17 22:21:30,590 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4467eaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:30, skipping insertion in model container [2020-07-17 22:21:30,590 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:21:30" (2/3) ... [2020-07-17 22:21:30,591 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4467eaf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:21:30, skipping insertion in model container [2020-07-17 22:21:30,591 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:21:30" (3/3) ... [2020-07-17 22:21:30,593 INFO L109 eAbstractionObserver]: Analyzing ICFG id_b5_o10-2.c [2020-07-17 22:21:30,604 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:21:30,612 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:21:30,628 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:21:30,667 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:21:30,667 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:21:30,668 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:21:30,668 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:21:30,668 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:21:30,668 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:21:30,668 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:21:30,668 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:21:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2020-07-17 22:21:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-17 22:21:30,702 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:30,703 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:21:30,704 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:30,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:30,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1250208381, now seen corresponding path program 1 times [2020-07-17 22:21:30,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:30,725 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630615516] [2020-07-17 22:21:30,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:30,989 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:30,990 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:30,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,023 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:31,024 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,026 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,028 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:31,028 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID [2020-07-17 22:21:31,029 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2020-07-17 22:21:31,029 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #30#return; {24#true} is VALID [2020-07-17 22:21:31,029 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret3 := main(); {24#true} is VALID [2020-07-17 22:21:31,030 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-17 22:21:31,030 INFO L263 TraceCheckUtils]: 5: Hoare triple {24#true} call #t~ret2 := id(~input~0); {24#true} is VALID [2020-07-17 22:21:31,031 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#true} ~x := #in~x; {24#true} is VALID [2020-07-17 22:21:31,032 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#true} assume 0 == ~x;#res := 0; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,033 INFO L280 TraceCheckUtils]: 8: Hoare triple {34#(<= |id_#res| 0)} assume true; {34#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:31,035 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {34#(<= |id_#res| 0)} {24#true} #34#return; {32#(<= |main_#t~ret2| 0)} is VALID [2020-07-17 22:21:31,036 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-17 22:21:31,038 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#(<= main_~result~0 0)} assume 10 == ~result~0; {25#false} is VALID [2020-07-17 22:21:31,038 INFO L280 TraceCheckUtils]: 12: Hoare triple {25#false} assume !false; {25#false} is VALID [2020-07-17 22:21:31,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:21:31,041 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630615516] [2020-07-17 22:21:31,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:31,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:31,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338208304] [2020-07-17 22:21:31,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:31,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:31,057 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:31,091 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-17 22:21:31,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:31,092 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:31,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:31,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:31,105 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 5 states. [2020-07-17 22:21:31,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,306 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2020-07-17 22:21:31,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:31,307 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-17 22:21:31,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:31,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:31,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:31,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2020-07-17 22:21:31,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2020-07-17 22:21:31,424 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:31,443 INFO L225 Difference]: With dead ends: 33 [2020-07-17 22:21:31,444 INFO L226 Difference]: Without dead ends: 19 [2020-07-17 22:21:31,454 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-17 22:21:31,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2020-07-17 22:21:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-07-17 22:21:31,516 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:31,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:31,518 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:31,518 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:31,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,526 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:31,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:31,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:31,528 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:31,528 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 19 states. [2020-07-17 22:21:31,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,537 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2020-07-17 22:21:31,537 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:31,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:31,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:31,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:31,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:31,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-07-17 22:21:31,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2020-07-17 22:21:31,543 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 13 [2020-07-17 22:21:31,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:31,545 INFO L479 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2020-07-17 22:21:31,545 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:31,545 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2020-07-17 22:21:31,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:31,547 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:31,548 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-17 22:21:31,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:21:31,550 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:31,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1951994857, now seen corresponding path program 1 times [2020-07-17 22:21:31,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:31,552 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491892888] [2020-07-17 22:21:31,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,628 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:31,629 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:31,766 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:31,767 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-17 22:21:31,769 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-17 22:21:31,771 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-17 22:21:31,772 INFO L280 TraceCheckUtils]: 0: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:31,772 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:31,772 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-17 22:21:31,773 INFO L280 TraceCheckUtils]: 3: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:31,774 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-17 22:21:31,775 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-17 22:21:31,777 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-17 22:21:31,779 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-17 22:21:31,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-17 22:21:31,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:31,781 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-17 22:21:31,782 INFO L263 TraceCheckUtils]: 0: Hoare triple {141#true} call ULTIMATE.init(); {141#true} is VALID [2020-07-17 22:21:31,782 INFO L280 TraceCheckUtils]: 1: Hoare triple {141#true} assume true; {141#true} is VALID [2020-07-17 22:21:31,783 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {141#true} {141#true} #30#return; {141#true} is VALID [2020-07-17 22:21:31,783 INFO L263 TraceCheckUtils]: 3: Hoare triple {141#true} call #t~ret3 := main(); {141#true} is VALID [2020-07-17 22:21:31,783 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-17 22:21:31,784 INFO L263 TraceCheckUtils]: 5: Hoare triple {141#true} call #t~ret2 := id(~input~0); {141#true} is VALID [2020-07-17 22:21:31,784 INFO L280 TraceCheckUtils]: 6: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:31,785 INFO L280 TraceCheckUtils]: 7: Hoare triple {141#true} assume !(0 == ~x); {141#true} is VALID [2020-07-17 22:21:31,785 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-17 22:21:31,785 INFO L280 TraceCheckUtils]: 9: Hoare triple {141#true} ~x := #in~x; {141#true} is VALID [2020-07-17 22:21:31,786 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-17 22:21:31,788 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-17 22:21:31,790 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-17 22:21:31,791 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-17 22:21:31,792 INFO L280 TraceCheckUtils]: 14: Hoare triple {163#(<= id_~ret~0 1)} assume ~ret~0 > 5;#res := 5; {142#false} is VALID [2020-07-17 22:21:31,792 INFO L280 TraceCheckUtils]: 15: Hoare triple {142#false} assume true; {142#false} is VALID [2020-07-17 22:21:31,793 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {142#false} {141#true} #34#return; {156#(<= |main_#t~ret2| 5)} is VALID [2020-07-17 22:21:31,794 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-17 22:21:31,795 INFO L280 TraceCheckUtils]: 18: Hoare triple {157#(<= main_~result~0 5)} assume 10 == ~result~0; {142#false} is VALID [2020-07-17 22:21:31,795 INFO L280 TraceCheckUtils]: 19: Hoare triple {142#false} assume !false; {142#false} is VALID [2020-07-17 22:21:31,797 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-17 22:21:31,797 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491892888] [2020-07-17 22:21:31,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:31,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-17 22:21:31,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610120969] [2020-07-17 22:21:31,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:31,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:31,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:21:31,846 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:31,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:21:31,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:31,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:21:31,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:21:31,847 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 7 states. [2020-07-17 22:21:31,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:31,977 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2020-07-17 22:21:31,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:31,977 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2020-07-17 22:21:31,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:31,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:21:31,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 36 transitions. [2020-07-17 22:21:31,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 36 transitions. [2020-07-17 22:21:32,033 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-17 22:21:32,035 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:21:32,036 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:32,037 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-17 22:21:32,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2020-07-17 22:21:32,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:32,045 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:32,045 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:32,045 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 21 states. [2020-07-17 22:21:32,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,049 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:32,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:32,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,050 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:32,050 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 23 states. [2020-07-17 22:21:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,054 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2020-07-17 22:21:32,054 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2020-07-17 22:21:32,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,055 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:32,055 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:32,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-07-17 22:21:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2020-07-17 22:21:32,057 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 20 [2020-07-17 22:21:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:32,058 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2020-07-17 22:21:32,058 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:21:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2020-07-17 22:21:32,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-17 22:21:32,059 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:32,059 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-17 22:21:32,059 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-17 22:21:32,060 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:32,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:32,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1923365706, now seen corresponding path program 1 times [2020-07-17 22:21:32,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:32,061 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334887481] [2020-07-17 22:21:32,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,119 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:32,120 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,216 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,217 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-17 22:21:32,217 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-17 22:21:32,219 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-17 22:21:32,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:32,220 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-17 22:21:32,221 INFO L280 TraceCheckUtils]: 3: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,221 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-17 22:21:32,222 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-17 22:21:32,224 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-17 22:21:32,225 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-17 22:21:32,226 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-17 22:21:32,227 INFO L280 TraceCheckUtils]: 9: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:32,228 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:32,229 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:32,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:32,229 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:32,230 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:32,230 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-17 22:21:32,230 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:32,230 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,231 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:32,231 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-17 22:21:32,231 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,232 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-17 22:21:32,233 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-17 22:21:32,235 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-17 22:21:32,236 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-17 22:21:32,237 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-17 22:21:32,238 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:32,239 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:32,239 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-17 22:21:32,240 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-17 22:21:32,241 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:32,242 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-17 22:21:32,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334887481] [2020-07-17 22:21:32,242 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1664812158] [2020-07-17 22:21:32,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:32,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:32,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,295 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:32,431 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:21:32,431 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:21:32,432 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #30#return; {279#true} is VALID [2020-07-17 22:21:32,432 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret3 := main(); {279#true} is VALID [2020-07-17 22:21:32,432 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-17 22:21:32,432 INFO L263 TraceCheckUtils]: 5: Hoare triple {279#true} call #t~ret2 := id(~input~0); {279#true} is VALID [2020-07-17 22:21:32,433 INFO L280 TraceCheckUtils]: 6: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,433 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} assume !(0 == ~x); {279#true} is VALID [2020-07-17 22:21:32,433 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-17 22:21:32,434 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} ~x := #in~x; {279#true} is VALID [2020-07-17 22:21:32,435 INFO L280 TraceCheckUtils]: 10: Hoare triple {279#true} assume 0 == ~x;#res := 0; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:32,435 INFO L280 TraceCheckUtils]: 11: Hoare triple {337#(<= |id_#res| 0)} assume true; {337#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:32,437 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {337#(<= |id_#res| 0)} {279#true} #36#return; {344#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:32,438 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-17 22:21:32,439 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-17 22:21:32,439 INFO L280 TraceCheckUtils]: 15: Hoare triple {302#(<= |id_#res| 1)} assume true; {302#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:32,441 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {302#(<= |id_#res| 1)} {279#true} #34#return; {294#(<= |main_#t~ret2| 1)} is VALID [2020-07-17 22:21:32,442 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-17 22:21:32,442 INFO L280 TraceCheckUtils]: 18: Hoare triple {295#(<= main_~result~0 1)} assume 10 == ~result~0; {280#false} is VALID [2020-07-17 22:21:32,443 INFO L280 TraceCheckUtils]: 19: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:21:32,444 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-17 22:21:32,445 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:32,445 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:32,445 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330081275] [2020-07-17 22:21:32,446 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:32,446 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:32,447 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:32,476 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:32,477 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:32,477 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:32,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:32,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:32,478 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 10 states. [2020-07-17 22:21:32,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,661 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:32,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:32,662 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2020-07-17 22:21:32,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:32,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:32,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 29 transitions. [2020-07-17 22:21:32,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 29 transitions. [2020-07-17 22:21:32,708 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-17 22:21:32,710 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:21:32,710 INFO L226 Difference]: Without dead ends: 23 [2020-07-17 22:21:32,711 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-17 22:21:32,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2020-07-17 22:21:32,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2020-07-17 22:21:32,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:32,719 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:32,720 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:32,720 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:32,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,723 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:32,723 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:32,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,724 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:32,724 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 23 states. [2020-07-17 22:21:32,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:32,727 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2020-07-17 22:21:32,727 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:32,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:32,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:32,729 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:32,729 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:32,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-17 22:21:32,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2020-07-17 22:21:32,731 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 20 [2020-07-17 22:21:32,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:32,732 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2020-07-17 22:21:32,732 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:32,732 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2020-07-17 22:21:32,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:32,733 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:32,734 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-17 22:21:32,946 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-17 22:21:32,947 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:32,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:32,948 INFO L82 PathProgramCache]: Analyzing trace with hash 376843494, now seen corresponding path program 1 times [2020-07-17 22:21:32,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:32,948 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509209125] [2020-07-17 22:21:32,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,007 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:33,008 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:33,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,134 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,135 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-17 22:21:33,136 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-17 22:21:33,138 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-17 22:21:33,138 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,139 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,139 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-17 22:21:33,139 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,140 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-17 22:21:33,141 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-17 22:21:33,142 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-17 22:21:33,143 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-17 22:21:33,144 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-17 22:21:33,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:33,146 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:33,147 INFO L280 TraceCheckUtils]: 0: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,147 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,147 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-17 22:21:33,148 INFO L280 TraceCheckUtils]: 3: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,148 INFO L280 TraceCheckUtils]: 4: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,148 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-17 22:21:33,148 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,149 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-17 22:21:33,150 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-17 22:21:33,152 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-17 22:21:33,153 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-17 22:21:33,154 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-17 22:21:33,154 INFO L280 TraceCheckUtils]: 12: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:33,156 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:33,157 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-17 22:21:33,158 INFO L280 TraceCheckUtils]: 15: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-17 22:21:33,158 INFO L280 TraceCheckUtils]: 16: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:33,158 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:33,159 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:33,159 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:33,160 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:33,160 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:33,160 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-17 22:21:33,160 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:33,161 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,161 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,161 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-17 22:21:33,161 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,162 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,162 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-17 22:21:33,162 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,163 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-17 22:21:33,164 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-17 22:21:33,165 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-17 22:21:33,166 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-17 22:21:33,167 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-17 22:21:33,168 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:33,169 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:33,170 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-17 22:21:33,171 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-17 22:21:33,171 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:33,171 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:33,171 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-17 22:21:33,172 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-17 22:21:33,172 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:33,173 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-17 22:21:33,173 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509209125] [2020-07-17 22:21:33,174 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808113688] [2020-07-17 22:21:33,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:33,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,210 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:21:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,219 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:33,302 INFO L263 TraceCheckUtils]: 0: Hoare triple {477#true} call ULTIMATE.init(); {477#true} is VALID [2020-07-17 22:21:33,302 INFO L280 TraceCheckUtils]: 1: Hoare triple {477#true} assume true; {477#true} is VALID [2020-07-17 22:21:33,303 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {477#true} {477#true} #30#return; {477#true} is VALID [2020-07-17 22:21:33,303 INFO L263 TraceCheckUtils]: 3: Hoare triple {477#true} call #t~ret3 := main(); {477#true} is VALID [2020-07-17 22:21:33,303 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-17 22:21:33,303 INFO L263 TraceCheckUtils]: 5: Hoare triple {477#true} call #t~ret2 := id(~input~0); {477#true} is VALID [2020-07-17 22:21:33,304 INFO L280 TraceCheckUtils]: 6: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,304 INFO L280 TraceCheckUtils]: 7: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,304 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-17 22:21:33,304 INFO L280 TraceCheckUtils]: 9: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,305 INFO L280 TraceCheckUtils]: 10: Hoare triple {477#true} assume !(0 == ~x); {477#true} is VALID [2020-07-17 22:21:33,305 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-17 22:21:33,305 INFO L280 TraceCheckUtils]: 12: Hoare triple {477#true} ~x := #in~x; {477#true} is VALID [2020-07-17 22:21:33,306 INFO L280 TraceCheckUtils]: 13: Hoare triple {477#true} assume 0 == ~x;#res := 0; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:33,306 INFO L280 TraceCheckUtils]: 14: Hoare triple {562#(<= |id_#res| 0)} assume true; {562#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:33,308 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {562#(<= |id_#res| 0)} {477#true} #36#return; {569#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:33,309 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-17 22:21:33,309 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-17 22:21:33,310 INFO L280 TraceCheckUtils]: 18: Hoare triple {518#(<= |id_#res| 1)} assume true; {518#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:33,311 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {518#(<= |id_#res| 1)} {477#true} #36#return; {510#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:33,312 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-17 22:21:33,313 INFO L280 TraceCheckUtils]: 21: Hoare triple {511#(<= id_~ret~0 2)} assume ~ret~0 > 5;#res := 5; {478#false} is VALID [2020-07-17 22:21:33,313 INFO L280 TraceCheckUtils]: 22: Hoare triple {478#false} assume true; {478#false} is VALID [2020-07-17 22:21:33,314 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {478#false} {477#true} #34#return; {478#false} is VALID [2020-07-17 22:21:33,314 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-17 22:21:33,314 INFO L280 TraceCheckUtils]: 25: Hoare triple {478#false} assume 10 == ~result~0; {478#false} is VALID [2020-07-17 22:21:33,315 INFO L280 TraceCheckUtils]: 26: Hoare triple {478#false} assume !false; {478#false} is VALID [2020-07-17 22:21:33,316 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-17 22:21:33,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:33,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2020-07-17 22:21:33,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434382896] [2020-07-17 22:21:33,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:33,317 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:33,318 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:21:33,350 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-17 22:21:33,350 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:21:33,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:33,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:21:33,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-07-17 22:21:33,351 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 10 states. [2020-07-17 22:21:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:33,529 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2020-07-17 22:21:33,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-07-17 22:21:33,530 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 27 [2020-07-17 22:21:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:33,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:33,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:33,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:21:33,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 40 transitions. [2020-07-17 22:21:33,535 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 40 transitions. [2020-07-17 22:21:33,588 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-17 22:21:33,589 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:21:33,590 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:21:33,590 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-17 22:21:33,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:21:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2020-07-17 22:21:33,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:33,598 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:33,598 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:33,598 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 25 states. [2020-07-17 22:21:33,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:33,601 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:33,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:33,602 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:33,602 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:33,602 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:33,602 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 27 states. [2020-07-17 22:21:33,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:33,605 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2020-07-17 22:21:33,605 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2020-07-17 22:21:33,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:33,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:33,606 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:33,606 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:33,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2020-07-17 22:21:33,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2020-07-17 22:21:33,608 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 27 [2020-07-17 22:21:33,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:33,608 INFO L479 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2020-07-17 22:21:33,609 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:21:33,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2020-07-17 22:21:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-07-17 22:21:33,610 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:33,610 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-17 22:21:33,822 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:33,823 INFO L427 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:33,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:33,824 INFO L82 PathProgramCache]: Analyzing trace with hash 405472645, now seen corresponding path program 2 times [2020-07-17 22:21:33,825 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:33,825 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840907941] [2020-07-17 22:21:33,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:33,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:33,895 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:33,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,093 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,094 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-17 22:21:34,095 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-17 22:21:34,097 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-17 22:21:34,098 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,098 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,098 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-17 22:21:34,098 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,099 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-17 22:21:34,100 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-17 22:21:34,102 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-17 22:21:34,103 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-17 22:21:34,103 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-17 22:21:34,104 INFO L280 TraceCheckUtils]: 9: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:34,105 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:34,106 INFO L280 TraceCheckUtils]: 0: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,106 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,106 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-17 22:21:34,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,107 INFO L280 TraceCheckUtils]: 4: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,107 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-17 22:21:34,107 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,108 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-17 22:21:34,109 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-17 22:21:34,111 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-17 22:21:34,111 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-17 22:21:34,112 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-17 22:21:34,113 INFO L280 TraceCheckUtils]: 12: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:34,115 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:34,115 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-17 22:21:34,116 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-17 22:21:34,117 INFO L280 TraceCheckUtils]: 16: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:34,118 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:34,119 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-17 22:21:34,119 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:34,119 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:34,120 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-17 22:21:34,120 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-17 22:21:34,120 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-17 22:21:34,121 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,121 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,121 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-17 22:21:34,121 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,121 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,122 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-17 22:21:34,122 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,123 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-17 22:21:34,124 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-17 22:21:34,140 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-17 22:21:34,142 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-17 22:21:34,145 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-17 22:21:34,149 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:34,151 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:34,152 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-17 22:21:34,153 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-17 22:21:34,154 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:34,155 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:34,156 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-17 22:21:34,157 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-17 22:21:34,157 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-17 22:21:34,159 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-17 22:21:34,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840907941] [2020-07-17 22:21:34,159 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761875] [2020-07-17 22:21:34,160 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) [2020-07-17 22:21:34,193 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:21:34,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:34,195 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 10 conjunts are in the unsatisfiable core [2020-07-17 22:21:34,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,208 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:21:34,336 INFO L263 TraceCheckUtils]: 0: Hoare triple {732#true} call ULTIMATE.init(); {732#true} is VALID [2020-07-17 22:21:34,337 INFO L280 TraceCheckUtils]: 1: Hoare triple {732#true} assume true; {732#true} is VALID [2020-07-17 22:21:34,337 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {732#true} {732#true} #30#return; {732#true} is VALID [2020-07-17 22:21:34,337 INFO L263 TraceCheckUtils]: 3: Hoare triple {732#true} call #t~ret3 := main(); {732#true} is VALID [2020-07-17 22:21:34,337 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-17 22:21:34,338 INFO L263 TraceCheckUtils]: 5: Hoare triple {732#true} call #t~ret2 := id(~input~0); {732#true} is VALID [2020-07-17 22:21:34,338 INFO L280 TraceCheckUtils]: 6: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,338 INFO L280 TraceCheckUtils]: 7: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,338 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-17 22:21:34,338 INFO L280 TraceCheckUtils]: 9: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,339 INFO L280 TraceCheckUtils]: 10: Hoare triple {732#true} assume !(0 == ~x); {732#true} is VALID [2020-07-17 22:21:34,339 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-17 22:21:34,339 INFO L280 TraceCheckUtils]: 12: Hoare triple {732#true} ~x := #in~x; {732#true} is VALID [2020-07-17 22:21:34,341 INFO L280 TraceCheckUtils]: 13: Hoare triple {732#true} assume 0 == ~x;#res := 0; {820#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:34,344 INFO L280 TraceCheckUtils]: 14: Hoare triple {820#(<= |id_#res| 0)} assume true; {820#(<= |id_#res| 0)} is VALID [2020-07-17 22:21:34,346 INFO L275 TraceCheckUtils]: 15: Hoare quadruple {820#(<= |id_#res| 0)} {732#true} #36#return; {827#(<= |id_#t~ret0| 0)} is VALID [2020-07-17 22:21:34,348 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-17 22:21:34,349 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-17 22:21:34,349 INFO L280 TraceCheckUtils]: 18: Hoare triple {776#(<= |id_#res| 1)} assume true; {776#(<= |id_#res| 1)} is VALID [2020-07-17 22:21:34,350 INFO L275 TraceCheckUtils]: 19: Hoare quadruple {776#(<= |id_#res| 1)} {732#true} #36#return; {767#(<= |id_#t~ret0| 1)} is VALID [2020-07-17 22:21:34,353 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-17 22:21:34,355 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-17 22:21:34,356 INFO L280 TraceCheckUtils]: 22: Hoare triple {769#(<= |id_#res| 2)} assume true; {769#(<= |id_#res| 2)} is VALID [2020-07-17 22:21:34,357 INFO L275 TraceCheckUtils]: 23: Hoare quadruple {769#(<= |id_#res| 2)} {732#true} #34#return; {754#(<= |main_#t~ret2| 2)} is VALID [2020-07-17 22:21:34,359 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-17 22:21:34,360 INFO L280 TraceCheckUtils]: 25: Hoare triple {755#(<= main_~result~0 2)} assume 10 == ~result~0; {733#false} is VALID [2020-07-17 22:21:34,360 INFO L280 TraceCheckUtils]: 26: Hoare triple {733#false} assume !false; {733#false} is VALID [2020-07-17 22:21:34,361 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-17 22:21:34,361 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-17 22:21:34,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2020-07-17 22:21:34,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422127164] [2020-07-17 22:21:34,363 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-17 22:21:34,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:34,363 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2020-07-17 22:21:34,402 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-17 22:21:34,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-07-17 22:21:34,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:34,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-07-17 22:21:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2020-07-17 22:21:34,403 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 13 states. [2020-07-17 22:21:34,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,598 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2020-07-17 22:21:34,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-07-17 22:21:34,598 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2020-07-17 22:21:34,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:34,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:34,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-17 22:21:34,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-07-17 22:21:34,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 33 transitions. [2020-07-17 22:21:34,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 33 transitions. [2020-07-17 22:21:34,656 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:34,657 INFO L225 Difference]: With dead ends: 31 [2020-07-17 22:21:34,657 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:21:34,658 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-17 22:21:34,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:21:34,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:21:34,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:34,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:34,668 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:34,668 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:34,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,671 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:34,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:34,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:34,672 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:34,672 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:21:34,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:34,675 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:34,675 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:34,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:34,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:34,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:34,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:34,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:21:34,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2020-07-17 22:21:34,678 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 27 [2020-07-17 22:21:34,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:34,678 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2020-07-17 22:21:34,678 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-07-17 22:21:34,678 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2020-07-17 22:21:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-07-17 22:21:34,679 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:21:34,680 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-17 22:21:34,893 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:21:34,894 INFO L427 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:21:34,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:21:34,895 INFO L82 PathProgramCache]: Analyzing trace with hash -645661089, now seen corresponding path program 2 times [2020-07-17 22:21:34,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:21:34,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287749649] [2020-07-17 22:21:34,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:21:34,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:34,953 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:34,953 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-17 22:21:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:35,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:35,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:35,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:21:35,031 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,031 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:35,032 INFO L280 TraceCheckUtils]: 2: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,032 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,032 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,033 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,033 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-17 22:21:35,033 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,033 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:35,034 INFO L280 TraceCheckUtils]: 5: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,034 INFO L275 TraceCheckUtils]: 6: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,034 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-17 22:21:35,034 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,035 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,035 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,040 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,040 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,040 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-17 22:21:35,041 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,041 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,041 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-17 22:21:35,041 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,042 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:35,042 INFO L280 TraceCheckUtils]: 8: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,042 INFO L275 TraceCheckUtils]: 9: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,043 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-17 22:21:35,043 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,043 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,044 INFO L275 TraceCheckUtils]: 13: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,044 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-17 22:21:35,045 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,045 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,045 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,046 INFO L280 TraceCheckUtils]: 0: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,046 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,046 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-17 22:21:35,047 INFO L280 TraceCheckUtils]: 3: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,047 INFO L280 TraceCheckUtils]: 4: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,047 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-17 22:21:35,047 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,048 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,048 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-17 22:21:35,048 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,048 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:35,049 INFO L280 TraceCheckUtils]: 11: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,049 INFO L275 TraceCheckUtils]: 12: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,049 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-17 22:21:35,049 INFO L280 TraceCheckUtils]: 14: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,050 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,050 INFO L275 TraceCheckUtils]: 16: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,050 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-17 22:21:35,050 INFO L280 TraceCheckUtils]: 18: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,051 INFO L280 TraceCheckUtils]: 19: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,051 INFO L275 TraceCheckUtils]: 20: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,051 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-17 22:21:35,054 INFO L280 TraceCheckUtils]: 22: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-17 22:21:35,055 INFO L280 TraceCheckUtils]: 23: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-17 22:21:35,056 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-17 22:21:35,057 INFO L263 TraceCheckUtils]: 0: Hoare triple {990#true} call ULTIMATE.init(); {990#true} is VALID [2020-07-17 22:21:35,057 INFO L280 TraceCheckUtils]: 1: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,058 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {990#true} {990#true} #30#return; {990#true} is VALID [2020-07-17 22:21:35,058 INFO L263 TraceCheckUtils]: 3: Hoare triple {990#true} call #t~ret3 := main(); {990#true} is VALID [2020-07-17 22:21:35,058 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-17 22:21:35,058 INFO L263 TraceCheckUtils]: 5: Hoare triple {990#true} call #t~ret2 := id(~input~0); {990#true} is VALID [2020-07-17 22:21:35,058 INFO L280 TraceCheckUtils]: 6: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,059 INFO L280 TraceCheckUtils]: 7: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,059 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-17 22:21:35,059 INFO L280 TraceCheckUtils]: 9: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,059 INFO L280 TraceCheckUtils]: 10: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,060 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-17 22:21:35,060 INFO L280 TraceCheckUtils]: 12: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,060 INFO L280 TraceCheckUtils]: 13: Hoare triple {990#true} assume !(0 == ~x); {990#true} is VALID [2020-07-17 22:21:35,060 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-17 22:21:35,061 INFO L280 TraceCheckUtils]: 15: Hoare triple {990#true} ~x := #in~x; {990#true} is VALID [2020-07-17 22:21:35,061 INFO L280 TraceCheckUtils]: 16: Hoare triple {990#true} assume 0 == ~x;#res := 0; {990#true} is VALID [2020-07-17 22:21:35,061 INFO L280 TraceCheckUtils]: 17: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,061 INFO L275 TraceCheckUtils]: 18: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,061 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-17 22:21:35,062 INFO L280 TraceCheckUtils]: 20: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,062 INFO L280 TraceCheckUtils]: 21: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,062 INFO L275 TraceCheckUtils]: 22: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,062 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-17 22:21:35,063 INFO L280 TraceCheckUtils]: 24: Hoare triple {990#true} assume !(~ret~0 > 5);#res := ~ret~0; {990#true} is VALID [2020-07-17 22:21:35,063 INFO L280 TraceCheckUtils]: 25: Hoare triple {990#true} assume true; {990#true} is VALID [2020-07-17 22:21:35,064 INFO L275 TraceCheckUtils]: 26: Hoare quadruple {990#true} {990#true} #36#return; {990#true} is VALID [2020-07-17 22:21:35,064 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-17 22:21:35,066 INFO L280 TraceCheckUtils]: 28: Hoare triple {990#true} assume ~ret~0 > 5;#res := 5; {1039#(<= |id_#res| 5)} is VALID [2020-07-17 22:21:35,066 INFO L280 TraceCheckUtils]: 29: Hoare triple {1039#(<= |id_#res| 5)} assume true; {1039#(<= |id_#res| 5)} is VALID [2020-07-17 22:21:35,069 INFO L275 TraceCheckUtils]: 30: Hoare quadruple {1039#(<= |id_#res| 5)} {990#true} #34#return; {1019#(<= |main_#t~ret2| 5)} is VALID [2020-07-17 22:21:35,071 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-17 22:21:35,071 INFO L280 TraceCheckUtils]: 32: Hoare triple {1020#(<= main_~result~0 5)} assume 10 == ~result~0; {991#false} is VALID [2020-07-17 22:21:35,072 INFO L280 TraceCheckUtils]: 33: Hoare triple {991#false} assume !false; {991#false} is VALID [2020-07-17 22:21:35,073 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-17 22:21:35,073 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287749649] [2020-07-17 22:21:35,073 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:21:35,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:21:35,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209767055] [2020-07-17 22:21:35,080 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-17 22:21:35,080 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:21:35,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:21:35,104 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-17 22:21:35,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:21:35,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:21:35,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:21:35,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:21:35,105 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 5 states. [2020-07-17 22:21:35,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:35,158 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2020-07-17 22:21:35,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:21:35,158 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-07-17 22:21:35,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:21:35,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:35,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-17 22:21:35,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:21:35,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2020-07-17 22:21:35,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 19 transitions. [2020-07-17 22:21:35,188 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:21:35,188 INFO L225 Difference]: With dead ends: 27 [2020-07-17 22:21:35,188 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:21:35,189 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-17 22:21:35,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:21:35,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:21:35,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:21:35,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:35,190 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:35,190 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:35,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:35,190 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:35,190 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:35,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:35,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:35,191 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:35,191 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:21:35,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:21:35,191 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:21:35,191 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:35,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:35,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:21:35,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:21:35,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:21:35,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:21:35,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:21:35,192 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 34 [2020-07-17 22:21:35,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:21:35,193 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:21:35,193 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:21:35,193 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:21:35,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:21:35,193 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-17 22:21:35,196 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:21:35,233 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:21:35,233 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:35,234 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:21:35,234 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:21:35,234 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:21:35,234 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:21:35,234 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-17 22:21:35,234 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 11 17) the Hoare annotation is: true [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point L14(lines 14 16) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L271 CegarLoopResult]: At program point L13(line 13) the Hoare annotation is: true [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point L13-1(line 13) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point L14-2(lines 11 17) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point idFINAL(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:21:35,235 INFO L268 CegarLoopResult]: For program point idEXIT(lines 4 9) no Hoare annotation was computed. [2020-07-17 22:21:35,236 INFO L271 CegarLoopResult]: At program point idENTRY(lines 4 9) the Hoare annotation is: true [2020-07-17 22:21:35,236 INFO L268 CegarLoopResult]: For program point L7(line 7) no Hoare annotation was computed. [2020-07-17 22:21:35,236 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-07-17 22:21:35,236 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed. [2020-07-17 22:21:35,236 INFO L268 CegarLoopResult]: For program point L6-1(line 6) no Hoare annotation was computed. [2020-07-17 22:21:35,241 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:35,241 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:21:35,242 WARN L170 areAnnotationChecker]: L13-1 has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: idFINAL has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: idEXIT has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: L6-1 has no Hoare annotation [2020-07-17 22:21:35,243 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:21:35,244 WARN L170 areAnnotationChecker]: L15 has no Hoare annotation [2020-07-17 22:21:35,244 WARN L170 areAnnotationChecker]: L14-2 has no Hoare annotation [2020-07-17 22:21:35,244 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:21:35,244 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation [2020-07-17 22:21:35,244 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:21:35,244 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-17 22:21:35,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:21:35 BoogieIcfgContainer [2020-07-17 22:21:35,247 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:21:35,250 INFO L168 Benchmark]: Toolchain (without parser) took 5363.23 ms. Allocated memory was 136.8 MB in the beginning and 284.7 MB in the end (delta: 147.8 MB). Free memory was 102.2 MB in the beginning and 254.5 MB in the end (delta: -152.3 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:21:35,251 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:21:35,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.37 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:35,252 INFO L168 Benchmark]: Boogie Preprocessor took 27.09 ms. Allocated memory is still 136.8 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:35,253 INFO L168 Benchmark]: RCFGBuilder took 418.95 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 165.1 MB in the end (delta: -74.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. [2020-07-17 22:21:35,253 INFO L168 Benchmark]: TraceAbstraction took 4661.55 ms. Allocated memory was 200.8 MB in the beginning and 284.7 MB in the end (delta: 83.9 MB). Free memory was 164.4 MB in the beginning and 254.5 MB in the end (delta: -90.1 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-07-17 22:21:35,256 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.24 ms. Allocated memory is still 136.8 MB. Free memory was 119.9 MB in the beginning and 119.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 249.37 ms. Allocated memory is still 136.8 MB. Free memory was 101.8 MB in the beginning and 92.3 MB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 27.09 ms. Allocated memory is still 136.8 MB. Free memory was 92.3 MB in the beginning and 91.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 418.95 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 91.0 MB in the beginning and 165.1 MB in the end (delta: -74.2 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 4661.55 ms. Allocated memory was 200.8 MB in the beginning and 284.7 MB in the end (delta: 83.9 MB). Free memory was 164.4 MB in the beginning and 254.5 MB in the end (delta: -90.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.5s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 1.3s, 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.3s 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.6s 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...