java -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/loop-invgen/sendmail-close-angle.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:15:28,429 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:15:28,431 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:15:28,451 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:15:28,451 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:15:28,453 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:15:28,455 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:15:28,467 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:15:28,469 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:15:28,470 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:15:28,473 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:15:28,475 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:15:28,475 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:15:28,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:15:28,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:15:28,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:15:28,479 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:15:28,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:15:28,482 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:15:28,484 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:15:28,486 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:15:28,487 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:15:28,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:15:28,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:15:28,496 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:15:28,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:15:28,497 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:15:28,498 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:15:28,498 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:15:28,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:15:28,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:15:28,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:15:28,503 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:15:28,504 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:15:28,506 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:15:28,506 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:15:28,507 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:15:28,507 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:15:28,507 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:15:28,509 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:15:28,511 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:15:28,511 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 [2019-10-14 23:15:28,532 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:15:28,532 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:15:28,534 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:15:28,534 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:15:28,535 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:15:28,535 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:15:28,535 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:15:28,535 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:15:28,535 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:15:28,536 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:15:28,537 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:15:28,537 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:15:28,537 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:15:28,538 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:15:28,538 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:15:28,538 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:15:28,538 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:15:28,538 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:15:28,539 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:15:28,539 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:15:28,539 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:15:28,539 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:15:28,539 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:15:28,540 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:15:28,540 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:15:28,540 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:15:28,540 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:15:28,540 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:15:28,541 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-14 23:15:28,813 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:15:28,827 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:15:28,830 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:15:28,831 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:15:28,832 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:15:28,833 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-14 23:15:28,896 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec1e6d2/fc2d926c337546f5aa0eae2514bffe05/FLAG4d69b11d4 [2019-10-14 23:15:29,381 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:15:29,381 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/sendmail-close-angle.i [2019-10-14 23:15:29,388 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec1e6d2/fc2d926c337546f5aa0eae2514bffe05/FLAG4d69b11d4 [2019-10-14 23:15:29,780 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/23ec1e6d2/fc2d926c337546f5aa0eae2514bffe05 [2019-10-14 23:15:29,791 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:15:29,793 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:15:29,794 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:29,794 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:15:29,797 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:15:29,798 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:29" (1/1) ... [2019-10-14 23:15:29,801 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f90b4c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:29, skipping insertion in model container [2019-10-14 23:15:29,802 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:15:29" (1/1) ... [2019-10-14 23:15:29,809 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:15:29,829 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:15:30,032 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:30,035 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:15:30,052 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:15:30,064 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:15:30,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30 WrapperNode [2019-10-14 23:15:30,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:15:30,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:15:30,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:15:30,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:15:30,163 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,169 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,171 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,186 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,187 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (1/1) ... [2019-10-14 23:15:30,189 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:15:30,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:15:30,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:15:30,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:15:30,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15: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 [2019-10-14 23:15:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:15:30,250 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:15:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:15:30,251 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:15:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:15:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:15:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:15:30,251 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:15:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:15:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:15:30,252 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:15:30,490 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:15:30,491 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-14 23:15:30,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:30 BoogieIcfgContainer [2019-10-14 23:15:30,500 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:15:30,501 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:15:30,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:15:30,512 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:15:30,512 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:15:29" (1/3) ... [2019-10-14 23:15:30,515 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bbd122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:30, skipping insertion in model container [2019-10-14 23:15:30,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:15:30" (2/3) ... [2019-10-14 23:15:30,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78bbd122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:15:30, skipping insertion in model container [2019-10-14 23:15:30,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:15:30" (3/3) ... [2019-10-14 23:15:30,521 INFO L109 eAbstractionObserver]: Analyzing ICFG sendmail-close-angle.i [2019-10-14 23:15:30,531 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:15:30,549 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:15:30,571 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:15:30,600 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:15:30,601 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:15:30,601 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:15:30,601 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:15:30,601 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:15:30,601 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:15:30,601 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:15:30,602 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:15:30,618 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-10-14 23:15:30,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:15:30,625 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:30,626 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:30,628 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:30,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:30,635 INFO L82 PathProgramCache]: Analyzing trace with hash -584482135, now seen corresponding path program 1 times [2019-10-14 23:15:30,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:30,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832385039] [2019-10-14 23:15:30,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:30,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832385039] [2019-10-14 23:15:30,755 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:30,755 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:15:30,756 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000543122] [2019-10-14 23:15:30,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:15:30,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:30,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:15:30,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:15:30,773 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 2 states. [2019-10-14 23:15:30,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:30,806 INFO L93 Difference]: Finished difference Result 61 states and 92 transitions. [2019-10-14 23:15:30,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:15:30,808 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-14 23:15:30,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:30,819 INFO L225 Difference]: With dead ends: 61 [2019-10-14 23:15:30,820 INFO L226 Difference]: Without dead ends: 29 [2019-10-14 23:15:30,824 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:15:30,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-14 23:15:30,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-14 23:15:30,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-14 23:15:30,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2019-10-14 23:15:30,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 14 [2019-10-14 23:15:30,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:30,874 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-10-14 23:15:30,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:15:30,875 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2019-10-14 23:15:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-14 23:15:30,877 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:30,877 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:30,878 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:30,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:30,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1528524609, now seen corresponding path program 1 times [2019-10-14 23:15:30,879 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:30,879 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580694552] [2019-10-14 23:15:30,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,880 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:30,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:31,043 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580694552] [2019-10-14 23:15:31,044 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:31,044 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:15:31,044 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475586079] [2019-10-14 23:15:31,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:15:31,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:15:31,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:15:31,047 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand 5 states. [2019-10-14 23:15:31,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:31,195 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2019-10-14 23:15:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-14 23:15:31,196 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-10-14 23:15:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:31,199 INFO L225 Difference]: With dead ends: 35 [2019-10-14 23:15:31,199 INFO L226 Difference]: Without dead ends: 33 [2019-10-14 23:15:31,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:31,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-14 23:15:31,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2019-10-14 23:15:31,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-14 23:15:31,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2019-10-14 23:15:31,223 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 15 [2019-10-14 23:15:31,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:31,224 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2019-10-14 23:15:31,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:15:31,224 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2019-10-14 23:15:31,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-14 23:15:31,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:31,227 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:31,227 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:31,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:31,228 INFO L82 PathProgramCache]: Analyzing trace with hash -552299140, now seen corresponding path program 1 times [2019-10-14 23:15:31,228 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:31,229 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968158385] [2019-10-14 23:15:31,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,230 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:31,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:15:31,340 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968158385] [2019-10-14 23:15:31,340 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:31,340 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:31,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601181484] [2019-10-14 23:15:31,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:31,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:31,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:31,343 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand 6 states. [2019-10-14 23:15:31,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:31,516 INFO L93 Difference]: Finished difference Result 48 states and 60 transitions. [2019-10-14 23:15:31,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:31,517 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-14 23:15:31,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:31,519 INFO L225 Difference]: With dead ends: 48 [2019-10-14 23:15:31,519 INFO L226 Difference]: Without dead ends: 46 [2019-10-14 23:15:31,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:31,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-14 23:15:31,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 44. [2019-10-14 23:15:31,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-10-14 23:15:31,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 56 transitions. [2019-10-14 23:15:31,545 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 56 transitions. Word has length 20 [2019-10-14 23:15:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:31,547 INFO L462 AbstractCegarLoop]: Abstraction has 44 states and 56 transitions. [2019-10-14 23:15:31,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:31,548 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 56 transitions. [2019-10-14 23:15:31,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:15:31,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:31,549 INFO L380 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:31,550 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:31,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:31,551 INFO L82 PathProgramCache]: Analyzing trace with hash -641752059, now seen corresponding path program 1 times [2019-10-14 23:15:31,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:31,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333553866] [2019-10-14 23:15:31,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,660 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-14 23:15:31,661 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333553866] [2019-10-14 23:15:31,666 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:31,666 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-14 23:15:31,667 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407070502] [2019-10-14 23:15:31,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-14 23:15:31,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-14 23:15:31,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:15:31,668 INFO L87 Difference]: Start difference. First operand 44 states and 56 transitions. Second operand 6 states. [2019-10-14 23:15:31,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:31,768 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2019-10-14 23:15:31,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-14 23:15:31,769 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-10-14 23:15:31,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:31,771 INFO L225 Difference]: With dead ends: 55 [2019-10-14 23:15:31,771 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 23:15:31,772 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:31,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 23:15:31,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 48. [2019-10-14 23:15:31,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-14 23:15:31,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 59 transitions. [2019-10-14 23:15:31,785 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 59 transitions. Word has length 28 [2019-10-14 23:15:31,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:31,785 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 59 transitions. [2019-10-14 23:15:31,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-14 23:15:31,786 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 59 transitions. [2019-10-14 23:15:31,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-14 23:15:31,787 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:31,798 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:31,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:31,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:31,799 INFO L82 PathProgramCache]: Analyzing trace with hash 7477945, now seen corresponding path program 1 times [2019-10-14 23:15:31,799 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:31,800 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748516795] [2019-10-14 23:15:31,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,800 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:31,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:31,911 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:31,912 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748516795] [2019-10-14 23:15:31,912 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:31,912 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-14 23:15:31,913 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572707946] [2019-10-14 23:15:31,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-14 23:15:31,914 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:31,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-14 23:15:31,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-14 23:15:31,915 INFO L87 Difference]: Start difference. First operand 48 states and 59 transitions. Second operand 7 states. [2019-10-14 23:15:32,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:32,117 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2019-10-14 23:15:32,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-14 23:15:32,117 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-10-14 23:15:32,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:32,119 INFO L225 Difference]: With dead ends: 70 [2019-10-14 23:15:32,119 INFO L226 Difference]: Without dead ends: 63 [2019-10-14 23:15:32,120 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-14 23:15:32,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-14 23:15:32,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2019-10-14 23:15:32,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-14 23:15:32,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 75 transitions. [2019-10-14 23:15:32,133 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 75 transitions. Word has length 31 [2019-10-14 23:15:32,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:32,135 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 75 transitions. [2019-10-14 23:15:32,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-14 23:15:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 75 transitions. [2019-10-14 23:15:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-14 23:15:32,136 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:32,136 INFO L380 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:32,137 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:32,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:32,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1583771254, now seen corresponding path program 1 times [2019-10-14 23:15:32,137 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:32,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523163942] [2019-10-14 23:15:32,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,138 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:32,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,255 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-14 23:15:32,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523163942] [2019-10-14 23:15:32,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:15:32,257 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-14 23:15:32,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460989746] [2019-10-14 23:15:32,258 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-14 23:15:32,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:32,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-14 23:15:32,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-10-14 23:15:32,261 INFO L87 Difference]: Start difference. First operand 61 states and 75 transitions. Second operand 8 states. [2019-10-14 23:15:32,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:32,442 INFO L93 Difference]: Finished difference Result 72 states and 86 transitions. [2019-10-14 23:15:32,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-14 23:15:32,443 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-10-14 23:15:32,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:32,444 INFO L225 Difference]: With dead ends: 72 [2019-10-14 23:15:32,445 INFO L226 Difference]: Without dead ends: 70 [2019-10-14 23:15:32,445 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-10-14 23:15:32,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2019-10-14 23:15:32,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 65. [2019-10-14 23:15:32,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2019-10-14 23:15:32,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2019-10-14 23:15:32,456 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 33 [2019-10-14 23:15:32,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:32,457 INFO L462 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2019-10-14 23:15:32,457 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-14 23:15:32,457 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2019-10-14 23:15:32,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-14 23:15:32,459 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:32,459 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:32,459 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:32,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:32,460 INFO L82 PathProgramCache]: Analyzing trace with hash 199583202, now seen corresponding path program 1 times [2019-10-14 23:15:32,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:32,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687536608] [2019-10-14 23:15:32,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,461 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:32,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,645 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 14 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 23:15:32,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687536608] [2019-10-14 23:15:32,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [461032736] [2019-10-14 23:15:32,647 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 [2019-10-14 23:15:32,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:32,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-14 23:15:32,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:32,892 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:32,944 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-14 23:15:32,945 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:32,945 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 16 [2019-10-14 23:15:32,945 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795391180] [2019-10-14 23:15:32,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-14 23:15:32,946 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:32,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-14 23:15:32,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-14 23:15:32,947 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand 16 states. [2019-10-14 23:15:33,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:33,620 INFO L93 Difference]: Finished difference Result 111 states and 146 transitions. [2019-10-14 23:15:33,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-14 23:15:33,620 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-10-14 23:15:33,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:33,625 INFO L225 Difference]: With dead ends: 111 [2019-10-14 23:15:33,626 INFO L226 Difference]: Without dead ends: 96 [2019-10-14 23:15:33,627 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 64 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=150, Invalid=500, Unknown=0, NotChecked=0, Total=650 [2019-10-14 23:15:33,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-10-14 23:15:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 91. [2019-10-14 23:15:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2019-10-14 23:15:33,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2019-10-14 23:15:33,658 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 56 [2019-10-14 23:15:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:33,660 INFO L462 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2019-10-14 23:15:33,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-14 23:15:33,661 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2019-10-14 23:15:33,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-14 23:15:33,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:33,663 INFO L380 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:33,866 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:33,867 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:33,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1513329503, now seen corresponding path program 1 times [2019-10-14 23:15:33,868 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:33,869 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995221090] [2019-10-14 23:15:33,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:33,869 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:33,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:33,971 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 23:15:33,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995221090] [2019-10-14 23:15:33,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249677921] [2019-10-14 23:15:33,972 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 [2019-10-14 23:15:34,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-14 23:15:34,018 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:34,112 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 14 proven. 9 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-10-14 23:15:34,140 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:34,140 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2019-10-14 23:15:34,140 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753795930] [2019-10-14 23:15:34,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-14 23:15:34,142 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-14 23:15:34,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-10-14 23:15:34,143 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 14 states. [2019-10-14 23:15:34,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:34,316 INFO L93 Difference]: Finished difference Result 97 states and 115 transitions. [2019-10-14 23:15:34,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-14 23:15:34,317 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 58 [2019-10-14 23:15:34,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:34,319 INFO L225 Difference]: With dead ends: 97 [2019-10-14 23:15:34,319 INFO L226 Difference]: Without dead ends: 95 [2019-10-14 23:15:34,319 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=260, Unknown=0, NotChecked=0, Total=342 [2019-10-14 23:15:34,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2019-10-14 23:15:34,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2019-10-14 23:15:34,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-10-14 23:15:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 113 transitions. [2019-10-14 23:15:34,333 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 113 transitions. Word has length 58 [2019-10-14 23:15:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:34,333 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 113 transitions. [2019-10-14 23:15:34,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-14 23:15:34,333 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 113 transitions. [2019-10-14 23:15:34,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-10-14 23:15:34,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:34,335 INFO L380 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:34,537 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:34,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:34,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:34,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1920756074, now seen corresponding path program 2 times [2019-10-14 23:15:34,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:34,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473269564] [2019-10-14 23:15:34,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:34,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:34,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:34,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 22 proven. 27 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-14 23:15:34,807 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473269564] [2019-10-14 23:15:34,808 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1236553493] [2019-10-14 23:15:34,808 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:34,862 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:15:34,863 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:34,864 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-14 23:15:34,869 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:35,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 68 proven. 35 refuted. 0 times theorem prover too weak. 166 trivial. 0 not checked. [2019-10-14 23:15:35,128 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:35,129 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2019-10-14 23:15:35,129 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469305817] [2019-10-14 23:15:35,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-14 23:15:35,130 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:35,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-14 23:15:35,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2019-10-14 23:15:35,131 INFO L87 Difference]: Start difference. First operand 95 states and 113 transitions. Second operand 23 states. [2019-10-14 23:15:36,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:36,136 INFO L93 Difference]: Finished difference Result 116 states and 137 transitions. [2019-10-14 23:15:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-14 23:15:36,136 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 83 [2019-10-14 23:15:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:36,138 INFO L225 Difference]: With dead ends: 116 [2019-10-14 23:15:36,139 INFO L226 Difference]: Without dead ends: 114 [2019-10-14 23:15:36,140 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=1053, Unknown=0, NotChecked=0, Total=1260 [2019-10-14 23:15:36,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-10-14 23:15:36,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 103. [2019-10-14 23:15:36,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2019-10-14 23:15:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 119 transitions. [2019-10-14 23:15:36,175 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 119 transitions. Word has length 83 [2019-10-14 23:15:36,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:36,176 INFO L462 AbstractCegarLoop]: Abstraction has 103 states and 119 transitions. [2019-10-14 23:15:36,176 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-14 23:15:36,176 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 119 transitions. [2019-10-14 23:15:36,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-14 23:15:36,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:36,182 INFO L380 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:36,393 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:36,393 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:36,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:36,394 INFO L82 PathProgramCache]: Analyzing trace with hash -357754430, now seen corresponding path program 2 times [2019-10-14 23:15:36,395 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:36,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025907293] [2019-10-14 23:15:36,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:36,396 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:36,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:36,716 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 30 proven. 27 refuted. 0 times theorem prover too weak. 426 trivial. 0 not checked. [2019-10-14 23:15:36,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025907293] [2019-10-14 23:15:36,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697230139] [2019-10-14 23:15:36,717 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:36,794 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-14 23:15:36,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:36,795 INFO L256 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-14 23:15:36,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:37,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:37,081 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 115 proven. 26 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-14 23:15:37,081 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:37,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13] total 21 [2019-10-14 23:15:37,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952432210] [2019-10-14 23:15:37,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-14 23:15:37,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:37,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-14 23:15:37,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-10-14 23:15:37,084 INFO L87 Difference]: Start difference. First operand 103 states and 119 transitions. Second operand 21 states. [2019-10-14 23:15:37,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:37,688 INFO L93 Difference]: Finished difference Result 109 states and 124 transitions. [2019-10-14 23:15:37,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-14 23:15:37,692 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 106 [2019-10-14 23:15:37,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:37,695 INFO L225 Difference]: With dead ends: 109 [2019-10-14 23:15:37,695 INFO L226 Difference]: Without dead ends: 100 [2019-10-14 23:15:37,696 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 128 SyntacticMatches, 3 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=793, Unknown=0, NotChecked=0, Total=992 [2019-10-14 23:15:37,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-14 23:15:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-10-14 23:15:37,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-10-14 23:15:37,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2019-10-14 23:15:37,715 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 106 [2019-10-14 23:15:37,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:37,715 INFO L462 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2019-10-14 23:15:37,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-14 23:15:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2019-10-14 23:15:37,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-10-14 23:15:37,717 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:15:37,717 INFO L380 BasicCegarLoop]: trace histogram [16, 15, 15, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:15:37,920 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:37,921 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:15:37,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:15:37,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1512190145, now seen corresponding path program 3 times [2019-10-14 23:15:37,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-14 23:15:37,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542823660] [2019-10-14 23:15:37,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:37,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:15:37,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:15:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:15:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 30 proven. 51 refuted. 0 times theorem prover too weak. 423 trivial. 0 not checked. [2019-10-14 23:15:38,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542823660] [2019-10-14 23:15:38,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155221032] [2019-10-14 23:15:38,173 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:38,230 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-10-14 23:15:38,231 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-14 23:15:38,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-14 23:15:38,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:15:38,576 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:15:38,641 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 100 proven. 62 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2019-10-14 23:15:38,642 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:15:38,642 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 17] total 28 [2019-10-14 23:15:38,642 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639430111] [2019-10-14 23:15:38,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-10-14 23:15:38,643 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-14 23:15:38,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-10-14 23:15:38,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=663, Unknown=0, NotChecked=0, Total=756 [2019-10-14 23:15:38,644 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand 28 states. [2019-10-14 23:15:39,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:15:39,919 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2019-10-14 23:15:39,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-14 23:15:39,920 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 108 [2019-10-14 23:15:39,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:15:39,921 INFO L225 Difference]: With dead ends: 119 [2019-10-14 23:15:39,921 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:15:39,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 126 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=390, Invalid=1866, Unknown=0, NotChecked=0, Total=2256 [2019-10-14 23:15:39,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:15:39,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:15:39,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:15:39,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:15:39,926 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 108 [2019-10-14 23:15:39,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:15:39,926 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:15:39,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-10-14 23:15:39,926 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:15:39,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:15:40,129 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:15:40,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:15:40,449 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 36 [2019-10-14 23:15:40,666 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-10-14 23:15:40,877 WARN L191 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 32 [2019-10-14 23:15:41,141 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-10-14 23:15:41,250 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 30 [2019-10-14 23:15:41,253 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-14 23:15:41,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:41,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:15:41,253 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-14 23:15:41,253 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:15:41,253 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:15:41,254 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-10-14 23:15:41,254 INFO L439 ceAbstractionStarter]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~buf~0 main_~buflim~0)) (.cse2 (< main_~bufferlen~0 main_~inlen~0)) (.cse3 (= main_~bufferlen~0 (+ main_~buflim~0 2)))) (or (and .cse0 .cse1 (<= main_~in~0 1) .cse2 .cse3 (<= 1 main_~buf~0)) (and (<= 0 main_~in~0) (<= main_~in~0 0) .cse1 .cse3 .cse4 (= main_~buf~0 0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse3 (<= 3 main_~buf~0) .cse0 .cse4 .cse1) (and .cse0 .cse1 .cse2 (<= main_~in~0 2) .cse3 (<= 2 main_~buf~0)))) [2019-10-14 23:15:41,254 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 10 42) no Hoare annotation was computed. [2019-10-14 23:15:41,254 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 34) no Hoare annotation was computed. [2019-10-14 23:15:41,254 INFO L439 ceAbstractionStarter]: At program point L23-3(lines 23 34) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-14 23:15:41,254 INFO L443 ceAbstractionStarter]: For program point L19(line 19) no Hoare annotation was computed. [2019-10-14 23:15:41,255 INFO L443 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2019-10-14 23:15:41,255 INFO L439 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-10-14 23:15:41,255 INFO L439 ceAbstractionStarter]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse1 (<= 1 main_~in~0)) (.cse3 (< main_~bufferlen~0 main_~inlen~0)) (.cse0 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse2 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse0 (<= 3 main_~buf~0) .cse1 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0)) .cse2) (and .cse1 .cse3 (<= main_~in~0 2) .cse0 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and .cse1 (<= main_~in~0 1) .cse3 .cse0 (<= 1 main_~buf~0) .cse2))) [2019-10-14 23:15:41,255 INFO L443 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-10-14 23:15:41,255 INFO L446 ceAbstractionStarter]: At program point L41(lines 11 42) the Hoare annotation is: true [2019-10-14 23:15:41,256 INFO L439 ceAbstractionStarter]: At program point L33(lines 23 34) the Hoare annotation is: (let ((.cse3 (<= (+ main_~in~0 main_~buflim~0 3) (+ main_~buf~0 main_~inlen~0))) (.cse0 (<= 1 main_~in~0)) (.cse1 (< main_~bufferlen~0 main_~inlen~0)) (.cse2 (= main_~bufferlen~0 (+ main_~buflim~0 2))) (.cse4 (< main_~buf~0 (+ main_~buflim~0 1)))) (or (and .cse0 .cse1 (<= main_~in~0 2) .cse2 (<= (+ main_~buf~0 2) main_~bufferlen~0) (<= 2 main_~buf~0)) (and (<= (+ main_~bufferlen~0 1) main_~inlen~0) .cse2 (<= 3 main_~buf~0) .cse0 .cse3 .cse4) (and .cse2 (<= 0 main_~in~0) .cse3 (<= main_~in~0 0) (= main_~buf~0 0) (<= 2 main_~bufferlen~0)) (and .cse0 (<= main_~in~0 1) .cse1 .cse2 (<= 1 main_~buf~0) .cse4))) [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point L25(lines 25 26) no Hoare annotation was computed. [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point L17(line 17) no Hoare annotation was computed. [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point L17-1(lines 11 42) no Hoare annotation was computed. [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 10 42) no Hoare annotation was computed. [2019-10-14 23:15:41,256 INFO L439 ceAbstractionStarter]: At program point L38(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-14 23:15:41,256 INFO L439 ceAbstractionStarter]: At program point L38-1(line 38) the Hoare annotation is: (and (<= (+ main_~buf~0 1) main_~bufferlen~0) (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= 2 main_~bufferlen~0)) [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point L30(lines 30 31) no Hoare annotation was computed. [2019-10-14 23:15:41,256 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 10 42) the Hoare annotation is: true [2019-10-14 23:15:41,256 INFO L443 ceAbstractionStarter]: For program point L18(lines 11 42) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L439 ceAbstractionStarter]: At program point L35(line 35) the Hoare annotation is: (and (<= 0 main_~in~0) (<= 0 main_~buf~0) (<= (+ main_~buf~0 2) main_~bufferlen~0)) [2019-10-14 23:15:41,257 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 3 8) the Hoare annotation is: true [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point L5(line 5) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 5) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point L4(lines 4 6) no Hoare annotation was computed. [2019-10-14 23:15:41,257 INFO L443 ceAbstractionStarter]: For program point L4-2(lines 3 8) no Hoare annotation was computed. [2019-10-14 23:15:41,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:15:41 BoogieIcfgContainer [2019-10-14 23:15:41,272 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:15:41,273 INFO L168 Benchmark]: Toolchain (without parser) took 11480.96 ms. Allocated memory was 145.8 MB in the beginning and 317.2 MB in the end (delta: 171.4 MB). Free memory was 101.9 MB in the beginning and 264.8 MB in the end (delta: -162.9 MB). Peak memory consumption was 177.3 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,274 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,275 INFO L168 Benchmark]: CACSL2BoogieTranslator took 271.67 ms. Allocated memory is still 145.8 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,276 INFO L168 Benchmark]: Boogie Preprocessor took 123.01 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 181.2 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,277 INFO L168 Benchmark]: RCFGBuilder took 310.90 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 167.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,277 INFO L168 Benchmark]: TraceAbstraction took 10770.38 ms. Allocated memory was 202.9 MB in the beginning and 317.2 MB in the end (delta: 114.3 MB). Free memory was 167.2 MB in the beginning and 264.8 MB in the end (delta: -97.6 MB). Peak memory consumption was 185.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:15:41,281 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 271.67 ms. Allocated memory is still 145.8 MB. Free memory was 101.7 MB in the beginning and 92.0 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.01 ms. Allocated memory was 145.8 MB in the beginning and 202.9 MB in the end (delta: 57.1 MB). Free memory was 92.0 MB in the beginning and 181.2 MB in the end (delta: -89.3 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 310.90 ms. Allocated memory is still 202.9 MB. Free memory was 181.2 MB in the beginning and 167.2 MB in the end (delta: 14.1 MB). Peak memory consumption was 14.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10770.38 ms. Allocated memory was 202.9 MB in the beginning and 317.2 MB in the end (delta: 114.3 MB). Free memory was 167.2 MB in the beginning and 264.8 MB in the end (delta: -97.6 MB). Peak memory consumption was 185.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((((1 <= in && bufferlen < inlen) && in <= 2) && bufferlen == buflim + 2) && buf + 2 <= bufferlen) && 2 <= buf) || (((((bufferlen + 1 <= inlen && bufferlen == buflim + 2) && 3 <= buf) && 1 <= in) && in + buflim + 3 <= buf + inlen) && buf < buflim + 1)) || (((((bufferlen == buflim + 2 && 0 <= in) && in + buflim + 3 <= buf + inlen) && in <= 0) && buf == 0) && 2 <= bufferlen)) || (((((1 <= in && in <= 1) && bufferlen < inlen) && bufferlen == buflim + 2) && 1 <= buf) && buf < buflim + 1) - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 35 locations, 1 error locations. Result: SAFE, OverallTime: 10.6s, OverallIterations: 11, TraceHistogramMax: 16, AutomataDifference: 4.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, HoareTripleCheckerStatistics: 419 SDtfs, 522 SDslu, 2087 SDs, 0 SdLazy, 2360 SolverSat, 715 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 718 GetRequests, 525 SyntacticMatches, 9 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1210 ImplicationChecksByTransitivity, 3.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 11 MinimizatonAttempts, 30 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 64 PreInvPairs, 113 NumberOfFragments, 513 HoareAnnotationTreeSize, 64 FomulaSimplifications, 1000 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 15 FomulaSimplificationsInter, 1510 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 963 NumberOfCodeBlocks, 958 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 947 ConstructedInterpolants, 0 QuantifiedInterpolants, 291238 SizeOfPredicates, 25 NumberOfNonLiveVariables, 782 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 16 InterpolantComputations, 6 PerfectInterpolantSequences, 2703/2972 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...