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 --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-new/nested-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 22:59:28,795 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:59:28,797 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:59:28,816 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:59:28,816 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:59:28,818 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:59:28,820 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:59:28,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:59:28,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:59:28,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:59:28,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:59:28,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:59:28,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:59:28,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:59:28,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:59:28,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:59:28,838 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:59:28,839 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:59:28,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:59:28,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:59:28,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:59:28,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:59:28,846 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:59:28,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:59:28,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:59:28,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:59:28,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:59:28,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:59:28,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:59:28,851 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:59:28,851 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:59:28,852 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:59:28,853 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:59:28,853 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:59:28,854 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:59:28,855 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:59:28,855 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:59:28,856 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:59:28,856 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:59:28,857 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:59:28,858 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:59:28,858 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-13 22:59:28,873 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:59:28,873 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:59:28,876 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:59:28,876 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:59:28,876 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:59:28,877 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:59:28,877 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:59:28,877 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:59:28,878 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:59:28,878 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:59:28,878 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:59:28,878 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:59:28,878 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:59:28,879 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:59:28,879 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:59:28,879 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:59:28,880 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:59:28,881 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:59:28,881 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:59:28,881 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:59:28,881 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:59:28,881 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:59:28,881 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:59:28,882 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:59:28,882 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:59:28,882 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:59:28,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:59:28,883 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:59:28,883 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:59:29,167 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:59:29,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:59:29,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:59:29,193 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:59:29,193 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:59:29,194 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/nested-1.i [2019-10-13 22:59:29,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e2f92fda/92ffd0a0f3984465b2c4aad12ae4315b/FLAG56133f6e2 [2019-10-13 22:59:29,783 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:59:29,784 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/nested-1.i [2019-10-13 22:59:29,791 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e2f92fda/92ffd0a0f3984465b2c4aad12ae4315b/FLAG56133f6e2 [2019-10-13 22:59:30,136 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e2f92fda/92ffd0a0f3984465b2c4aad12ae4315b [2019-10-13 22:59:30,146 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:59:30,147 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:59:30,148 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:30,148 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:59:30,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:59:30,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,155 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5475bceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30, skipping insertion in model container [2019-10-13 22:59:30,155 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,162 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:59:30,178 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:59:30,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:30,351 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:59:30,373 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:59:30,384 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:59:30,385 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30 WrapperNode [2019-10-13 22:59:30,385 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:59:30,385 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:59:30,385 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:59:30,385 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:59:30,487 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,487 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,492 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,492 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,496 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,500 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,501 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (1/1) ... [2019-10-13 22:59:30,503 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:59:30,503 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:59:30,503 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:59:30,504 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:59:30,504 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59: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-13 22:59:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:59:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:59:30,566 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-13 22:59:30,567 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:59:30,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:59:30,568 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:59:30,816 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:59:30,817 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-13 22:59:30,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:30 BoogieIcfgContainer [2019-10-13 22:59:30,819 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:59:30,821 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:59:30,822 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:59:30,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:59:30,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:59:30" (1/3) ... [2019-10-13 22:59:30,835 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64deb34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:30, skipping insertion in model container [2019-10-13 22:59:30,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:59:30" (2/3) ... [2019-10-13 22:59:30,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64deb34f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:59:30, skipping insertion in model container [2019-10-13 22:59:30,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:59:30" (3/3) ... [2019-10-13 22:59:30,838 INFO L109 eAbstractionObserver]: Analyzing ICFG nested-1.i [2019-10-13 22:59:30,869 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:59:30,888 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:59:30,900 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:59:30,935 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:59:30,936 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:59:30,936 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:59:30,936 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:59:30,936 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:59:30,936 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:59:30,937 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:59:30,937 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:59:30,953 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2019-10-13 22:59:30,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:59:30,958 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:30,959 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:30,960 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:30,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1228495020, now seen corresponding path program 1 times [2019-10-13 22:59:30,972 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:30,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695814724] [2019-10-13 22:59:30,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:30,973 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:30,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:31,125 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-13 22:59:31,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695814724] [2019-10-13 22:59:31,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:31,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:59:31,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487154268] [2019-10-13 22:59:31,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:59:31,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:31,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:59:31,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:31,155 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 4 states. [2019-10-13 22:59:31,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:31,238 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2019-10-13 22:59:31,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:59:31,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-13 22:59:31,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:31,250 INFO L225 Difference]: With dead ends: 37 [2019-10-13 22:59:31,251 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 22:59:31,254 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:59:31,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 22:59:31,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2019-10-13 22:59:31,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-10-13 22:59:31,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2019-10-13 22:59:31,306 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2019-10-13 22:59:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:31,307 INFO L462 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2019-10-13 22:59:31,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:59:31,309 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2019-10-13 22:59:31,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:59:31,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:31,311 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:31,312 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:31,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:31,314 INFO L82 PathProgramCache]: Analyzing trace with hash 439510219, now seen corresponding path program 1 times [2019-10-13 22:59:31,314 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:31,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585486930] [2019-10-13 22:59:31,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:31,315 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:31,316 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:31,405 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:31,407 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585486930] [2019-10-13 22:59:31,408 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:31,408 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:59:31,409 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895930996] [2019-10-13 22:59:31,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:59:31,411 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:31,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:59:31,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:59:31,412 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 4 states. [2019-10-13 22:59:31,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:31,453 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2019-10-13 22:59:31,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:59:31,454 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 22:59:31,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:31,456 INFO L225 Difference]: With dead ends: 23 [2019-10-13 22:59:31,456 INFO L226 Difference]: Without dead ends: 16 [2019-10-13 22:59:31,457 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 22:59:31,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-10-13 22:59:31,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-13 22:59:31,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-13 22:59:31,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 17 transitions. [2019-10-13 22:59:31,467 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 17 transitions. Word has length 14 [2019-10-13 22:59:31,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:31,467 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 17 transitions. [2019-10-13 22:59:31,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:59:31,468 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 17 transitions. [2019-10-13 22:59:31,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:59:31,468 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:31,469 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:31,469 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:31,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:31,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1862123311, now seen corresponding path program 1 times [2019-10-13 22:59:31,470 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:31,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405862997] [2019-10-13 22:59:31,470 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:31,471 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:31,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:31,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:31,562 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:31,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405862997] [2019-10-13 22:59:31,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1064694335] [2019-10-13 22:59:31,563 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-13 22:59:31,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:31,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 22:59:31,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:31,696 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:31,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:31,766 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1845732268] [2019-10-13 22:59:31,800 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:59:31,800 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:31,824 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:31,844 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:31,845 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:31,906 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:32,516 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:32,549 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:32,556 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:32,556 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:32,556 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-13 22:59:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-13 22:59:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (not (< main_~j~0 main_~m~0)) (<= 0 main_~j~0) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-13 22:59:32,557 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:32,558 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-13 22:59:32,559 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:32,560 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-13 22:59:32,560 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:32,560 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:32,561 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-13 22:59:32,561 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:32,562 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:32,562 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:32,953 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:32,954 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 9] total 21 [2019-10-13 22:59:32,954 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155962307] [2019-10-13 22:59:32,956 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-13 22:59:32,956 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:32,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-13 22:59:32,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2019-10-13 22:59:32,970 INFO L87 Difference]: Start difference. First operand 16 states and 17 transitions. Second operand 21 states. [2019-10-13 22:59:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:33,574 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2019-10-13 22:59:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-13 22:59:33,575 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 15 [2019-10-13 22:59:33,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:33,576 INFO L225 Difference]: With dead ends: 32 [2019-10-13 22:59:33,576 INFO L226 Difference]: Without dead ends: 24 [2019-10-13 22:59:33,577 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=201, Invalid=855, Unknown=0, NotChecked=0, Total=1056 [2019-10-13 22:59:33,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-13 22:59:33,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 19. [2019-10-13 22:59:33,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-13 22:59:33,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2019-10-13 22:59:33,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 15 [2019-10-13 22:59:33,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:33,586 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2019-10-13 22:59:33,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-13 22:59:33,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2019-10-13 22:59:33,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:59:33,587 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:33,588 INFO L380 BasicCegarLoop]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:33,792 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:33,799 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:33,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:33,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1028404811, now seen corresponding path program 2 times [2019-10-13 22:59:33,799 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:33,799 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676278844] [2019-10-13 22:59:33,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:33,800 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:33,800 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:33,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:33,917 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:33,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676278844] [2019-10-13 22:59:33,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452248003] [2019-10-13 22:59:33,918 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 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-13 22:59:33,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-13 22:59:33,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:33,963 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 22:59:33,965 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:34,028 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 22:59:34,029 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:34,075 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2019-10-13 22:59:34,075 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1829110066] [2019-10-13 22:59:34,076 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:59:34,077 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:34,077 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:34,077 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:34,086 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:34,101 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:34,474 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:34,500 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:34,503 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:34,503 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:34,504 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-13 22:59:34,504 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-13 22:59:34,504 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (not (< main_~j~0 main_~m~0)) (<= 0 main_~j~0) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-13 22:59:34,505 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:34,505 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:34,506 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-13 22:59:34,506 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:34,506 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-13 22:59:34,507 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:34,507 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:34,507 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-13 22:59:34,508 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:34,509 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:34,510 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:34,880 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:34,881 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 5, 9] total 23 [2019-10-13 22:59:34,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365949257] [2019-10-13 22:59:34,882 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-13 22:59:34,882 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:34,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-13 22:59:34,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2019-10-13 22:59:34,883 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand 23 states. [2019-10-13 22:59:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:37,009 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2019-10-13 22:59:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2019-10-13 22:59:37,009 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 18 [2019-10-13 22:59:37,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:37,012 INFO L225 Difference]: With dead ends: 64 [2019-10-13 22:59:37,012 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 22:59:37,015 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1009 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=804, Invalid=3102, Unknown=0, NotChecked=0, Total=3906 [2019-10-13 22:59:37,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 22:59:37,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 51. [2019-10-13 22:59:37,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-10-13 22:59:37,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2019-10-13 22:59:37,027 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 18 [2019-10-13 22:59:37,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:37,028 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2019-10-13 22:59:37,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-13 22:59:37,028 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2019-10-13 22:59:37,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-13 22:59:37,029 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:37,029 INFO L380 BasicCegarLoop]: trace histogram [17, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:37,235 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:37,236 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:37,237 INFO L82 PathProgramCache]: Analyzing trace with hash 2137855798, now seen corresponding path program 3 times [2019-10-13 22:59:37,237 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:37,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381944956] [2019-10-13 22:59:37,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:37,238 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:37,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:37,730 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 220 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:59:37,730 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381944956] [2019-10-13 22:59:37,731 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814376472] [2019-10-13 22:59:37,731 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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-13 22:59:37,791 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-13 22:59:37,792 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-13 22:59:37,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-13 22:59:37,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:38,092 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 132 proven. 40 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 22:59:38,092 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 127 proven. 45 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 22:59:38,365 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1318718763] [2019-10-13 22:59:38,367 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:59:38,367 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:38,368 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:38,368 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:38,368 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:38,396 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:38,629 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:38,640 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:38,642 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:38,642 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:38,642 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-13 22:59:38,643 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-13 22:59:38,643 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (not (< main_~j~0 main_~m~0)) (<= 0 main_~j~0) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-13 22:59:38,643 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:38,643 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-13 22:59:38,644 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:38,648 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:38,648 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-13 22:59:38,648 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:38,649 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:38,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-13 22:59:38,649 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:38,649 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:38,649 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:39,142 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:39,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 13, 13, 9] total 53 [2019-10-13 22:59:39,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782828300] [2019-10-13 22:59:39,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 53 states [2019-10-13 22:59:39,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2019-10-13 22:59:39,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=2540, Unknown=0, NotChecked=0, Total=2756 [2019-10-13 22:59:39,147 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand 53 states. [2019-10-13 22:59:41,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:41,057 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2019-10-13 22:59:41,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-13 22:59:41,057 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 37 [2019-10-13 22:59:41,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:41,059 INFO L225 Difference]: With dead ends: 98 [2019-10-13 22:59:41,059 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 22:59:41,063 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 82 SyntacticMatches, 6 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1364 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=669, Invalid=5337, Unknown=0, NotChecked=0, Total=6006 [2019-10-13 22:59:41,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 22:59:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-10-13 22:59:41,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-10-13 22:59:41,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2019-10-13 22:59:41,076 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 37 [2019-10-13 22:59:41,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:41,077 INFO L462 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2019-10-13 22:59:41,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 53 states. [2019-10-13 22:59:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2019-10-13 22:59:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-10-13 22:59:41,079 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:41,079 INFO L380 BasicCegarLoop]: trace histogram [40, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:41,288 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:41,289 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:41,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:41,290 INFO L82 PathProgramCache]: Analyzing trace with hash -1178038992, now seen corresponding path program 4 times [2019-10-13 22:59:41,290 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:41,290 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609520892] [2019-10-13 22:59:41,290 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:41,291 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:41,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:41,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:41,437 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-13 22:59:41,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609520892] [2019-10-13 22:59:41,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065422675] [2019-10-13 22:59:41,438 INFO L92 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY 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-13 22:59:41,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:41,522 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-13 22:59:41,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 22:59:41,593 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-13 22:59:41,593 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 22:59:41,659 INFO L134 CoverageAnalysis]: Checked inductivity of 956 backedges. 0 proven. 736 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2019-10-13 22:59:41,659 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [780040343] [2019-10-13 22:59:41,660 INFO L162 IcfgInterpreter]: Started Sifa with 14 locations of interest [2019-10-13 22:59:41,661 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 22:59:41,661 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 22:59:41,661 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 22:59:41,662 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 22:59:41,669 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 1 for LOIs [2019-10-13 22:59:41,862 INFO L199 IcfgInterpreter]: Interpreting procedure __VERIFIER_assert with input of size 6 for LOIs [2019-10-13 22:59:41,871 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 1 for LOIs [2019-10-13 22:59:41,872 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-13 22:59:41,872 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-13 22:59:41,873 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initFINAL satisfy 200#true [2019-10-13 22:59:41,873 INFO L193 IcfgInterpreter]: Reachable states at location L17-4 satisfy 177#(and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~i~0) (<= 10 main_~n~0)) [2019-10-13 22:59:41,873 INFO L193 IcfgInterpreter]: Reachable states at location L17-3 satisfy 149#(and (or (and (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 (+ main_~n~0 2147483648)) (<= main_~m~0 2147483647) (<= main_~i~0 0) (= main_~k~0 0) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (= main_~i~0 0)) (and (not (< main_~j~0 main_~m~0)) (<= 0 main_~j~0) (<= 1 main_~i~0))) (or (and (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= 10 main_~j~0) (<= main_~m~0 10000) (<= 10 main_~n~0)) (and (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~k~0 0) (<= main_~i~0 0) (<= main_~m~0 10000) (<= 10 main_~n~0)))) [2019-10-13 22:59:41,873 INFO L193 IcfgInterpreter]: Reachable states at location L4 satisfy 186#(and (or (and (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) (and (<= 1 __VERIFIER_assert_~cond) (<= 1 |__VERIFIER_assert_#in~cond|) (<= __VERIFIER_assert_~cond 1) (<= |__VERIFIER_assert_#in~cond| 1))) (or (and (= |__VERIFIER_assert_#in~cond| 0) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)))) [2019-10-13 22:59:41,873 INFO L193 IcfgInterpreter]: Reachable states at location L18-3 satisfy 144#(and (<= 0 main_~j~0) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= 10 main_~m~0) (<= main_~n~0 10000) (<= main_~m~0 10000) (<= 10 main_~n~0)) [2019-10-13 22:59:41,874 INFO L193 IcfgInterpreter]: Reachable states at location L15 satisfy 38#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647)) [2019-10-13 22:59:41,874 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION satisfy 196#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:41,874 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 43#(and (<= main_~n~0 2147483647) (<= 0 main_~k~0) (<= main_~n~0 10000) (= main_~k~0 0) (<= 0 (+ main_~n~0 2147483648)) (<= 0 (+ main_~m~0 2147483648)) (<= main_~k~0 0) (<= main_~m~0 2147483647) (<= 10 main_~n~0)) [2019-10-13 22:59:41,875 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#true [2019-10-13 22:59:41,875 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#true [2019-10-13 22:59:41,879 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#true [2019-10-13 22:59:41,879 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-13 22:59:41,879 INFO L193 IcfgInterpreter]: Reachable states at location L5 satisfy 191#(and (or (and (= |__VERIFIER_assert_#in~cond| 0) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)) (and (= |__VERIFIER_assert_#in~cond| 1) (= 0 __VERIFIER_assert_~cond) (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond))) (<= __VERIFIER_assert_~cond 0) (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0) (<= 0 __VERIFIER_assert_~cond)) [2019-10-13 22:59:41,879 INFO L193 IcfgInterpreter]: Reachable states at location __VERIFIER_assertENTRY satisfy 181#(and (or (and (<= 1 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 1)) (and (<= 0 |__VERIFIER_assert_#in~cond|) (<= |__VERIFIER_assert_#in~cond| 0))) (or (= |__VERIFIER_assert_#in~cond| 1) (= |__VERIFIER_assert_#in~cond| 0))) [2019-10-13 22:59:42,153 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-13 22:59:42,154 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8, 9] total 27 [2019-10-13 22:59:42,154 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [170253599] [2019-10-13 22:59:42,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-13 22:59:42,156 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:42,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-13 22:59:42,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-10-13 22:59:42,156 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 27 states. [2019-10-13 22:59:43,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:43,336 INFO L93 Difference]: Finished difference Result 138 states and 153 transitions. [2019-10-13 22:59:43,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 22:59:43,337 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 60 [2019-10-13 22:59:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:43,340 INFO L225 Difference]: With dead ends: 138 [2019-10-13 22:59:43,340 INFO L226 Difference]: Without dead ends: 133 [2019-10-13 22:59:43,341 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=614, Invalid=1836, Unknown=0, NotChecked=0, Total=2450 [2019-10-13 22:59:43,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-10-13 22:59:43,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-10-13 22:59:43,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-10-13 22:59:43,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2019-10-13 22:59:43,367 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 60 [2019-10-13 22:59:43,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:43,367 INFO L462 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2019-10-13 22:59:43,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-13 22:59:43,368 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2019-10-13 22:59:43,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-13 22:59:43,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:59:43,372 INFO L380 BasicCegarLoop]: trace histogram [100, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:59:43,575 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 22:59:43,575 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:59:43,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:59:43,576 INFO L82 PathProgramCache]: Analyzing trace with hash 259705594, now seen corresponding path program 5 times [2019-10-13 22:59:43,576 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:59:43,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060463614] [2019-10-13 22:59:43,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:43,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:59:43,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:59:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:59:48,243 INFO L134 CoverageAnalysis]: Checked inductivity of 6050 backedges. 6041 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-13 22:59:48,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060463614] [2019-10-13 22:59:48,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:59:48,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [105] imperfect sequences [] total 105 [2019-10-13 22:59:48,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979529034] [2019-10-13 22:59:48,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 105 states [2019-10-13 22:59:48,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:59:48,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2019-10-13 22:59:48,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5257, Invalid=5663, Unknown=0, NotChecked=0, Total=10920 [2019-10-13 22:59:48,249 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand 105 states. [2019-10-13 22:59:49,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:59:49,615 INFO L93 Difference]: Finished difference Result 5128 states and 5588 transitions. [2019-10-13 22:59:49,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2019-10-13 22:59:49,615 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 132 [2019-10-13 22:59:49,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:59:49,616 INFO L225 Difference]: With dead ends: 5128 [2019-10-13 22:59:49,617 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:59:49,630 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5261, Invalid=5869, Unknown=0, NotChecked=0, Total=11130 [2019-10-13 22:59:49,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:59:49,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:59:49,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:59:49,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:59:49,632 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 132 [2019-10-13 22:59:49,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:59:49,632 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:59:49,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 105 states. [2019-10-13 22:59:49,632 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:59:49,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:59:49,637 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:59:52,187 WARN L191 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 693 DAG size of output: 692