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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf -i ../../../trunk/examples/svcomp/loop-invgen/heapsort.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:25:35,954 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:25:35,957 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:25:35,968 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:25:35,969 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:25:35,970 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:25:35,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:25:35,973 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:25:35,975 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:25:35,976 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:25:35,977 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:25:35,978 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:25:35,978 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:25:35,979 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:25:35,980 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:25:35,982 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:25:35,982 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:25:35,983 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:25:35,985 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:25:35,987 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:25:35,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:25:35,990 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:25:35,991 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:25:35,992 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:25:35,994 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:25:35,994 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:25:35,994 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:25:35,995 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:25:35,996 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:25:35,997 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:25:35,997 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:25:35,998 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:25:35,999 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:25:36,000 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:25:36,001 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:25:36,001 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:25:36,002 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:25:36,002 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:25:36,002 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:25:36,003 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:25:36,004 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:25:36,005 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:25:36,024 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:25:36,025 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:25:36,026 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:25:36,026 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:25:36,027 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:25:36,027 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:25:36,027 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:25:36,027 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:25:36,028 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:25:36,028 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:25:36,030 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:25:36,031 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:25:36,031 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:25:36,031 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:25:36,032 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:25:36,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:25:36,032 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:25:36,032 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:25:36,032 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:25:36,033 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:25:36,033 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:25:36,033 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:25:36,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:25:36,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:25:36,034 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:25:36,034 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:25:36,035 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:25:36,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:25:36,035 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:25:36,035 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:25:36,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:25:36,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:25:36,111 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:25:36,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:25:36,113 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:25:36,114 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-20 13:25:36,186 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767dd497b/c51514b69e3a424e983cd98da8315554/FLAG3e01f32fb [2019-09-20 13:25:36,607 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:25:36,608 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/heapsort.i [2019-09-20 13:25:36,614 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767dd497b/c51514b69e3a424e983cd98da8315554/FLAG3e01f32fb [2019-09-20 13:25:37,021 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/767dd497b/c51514b69e3a424e983cd98da8315554 [2019-09-20 13:25:37,030 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:25:37,032 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:25:37,035 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:37,035 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:25:37,040 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:25:37,041 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5592382a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37, skipping insertion in model container [2019-09-20 13:25:37,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,052 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:25:37,068 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:25:37,244 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:37,249 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:25:37,272 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:25:37,289 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:25:37,289 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37 WrapperNode [2019-09-20 13:25:37,289 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:25:37,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:25:37,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:25:37,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:25:37,393 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,393 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,427 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (1/1) ... [2019-09-20 13:25:37,432 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:25:37,433 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:25:37,433 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:25:37,433 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:25:37,434 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (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-09-20 13:25:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:25:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:25:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-20 13:25:37,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:25:37,498 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:25:37,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:25:37,792 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:25:37,795 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-09-20 13:25:37,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:37 BoogieIcfgContainer [2019-09-20 13:25:37,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:25:37,797 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:25:37,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:25:37,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:25:37,801 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:25:37" (1/3) ... [2019-09-20 13:25:37,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12414875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:37, skipping insertion in model container [2019-09-20 13:25:37,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:25:37" (2/3) ... [2019-09-20 13:25:37,802 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@12414875 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:25:37, skipping insertion in model container [2019-09-20 13:25:37,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:25:37" (3/3) ... [2019-09-20 13:25:37,804 INFO L109 eAbstractionObserver]: Analyzing ICFG heapsort.i [2019-09-20 13:25:37,813 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:25:37,818 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:25:37,833 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:25:37,859 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:25:37,859 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:25:37,859 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:25:37,859 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:25:37,859 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:25:37,860 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:25:37,860 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:25:37,860 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:25:37,877 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states. [2019-09-20 13:25:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:37,886 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:37,887 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:37,889 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:37,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:37,893 INFO L82 PathProgramCache]: Analyzing trace with hash 648615897, now seen corresponding path program 1 times [2019-09-20 13:25:37,895 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:37,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:37,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:37,940 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:37,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:38,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,139 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,152 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 5 states. [2019-09-20 13:25:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,257 INFO L93 Difference]: Finished difference Result 47 states and 66 transitions. [2019-09-20 13:25:38,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:38,259 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 13:25:38,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,270 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:25:38,270 INFO L226 Difference]: Without dead ends: 42 [2019-09-20 13:25:38,273 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-20 13:25:38,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-20 13:25:38,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2019-09-20 13:25:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-09-20 13:25:38,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2019-09-20 13:25:38,330 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 14 [2019-09-20 13:25:38,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,330 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2019-09-20 13:25:38,331 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,331 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2019-09-20 13:25:38,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:38,332 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,332 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,333 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,333 INFO L82 PathProgramCache]: Analyzing trace with hash 653352666, now seen corresponding path program 1 times [2019-09-20 13:25:38,334 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:38,433 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:38,433 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:38,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:38,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:38,436 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand 5 states. [2019-09-20 13:25:38,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,529 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2019-09-20 13:25:38,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:38,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-09-20 13:25:38,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,531 INFO L225 Difference]: With dead ends: 47 [2019-09-20 13:25:38,532 INFO L226 Difference]: Without dead ends: 47 [2019-09-20 13:25:38,533 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-20 13:25:38,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-09-20 13:25:38,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2019-09-20 13:25:38,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-09-20 13:25:38,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 63 transitions. [2019-09-20 13:25:38,544 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 63 transitions. Word has length 14 [2019-09-20 13:25:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,544 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 63 transitions. [2019-09-20 13:25:38,544 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:38,544 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 63 transitions. [2019-09-20 13:25:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-09-20 13:25:38,545 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,545 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,546 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,546 INFO L82 PathProgramCache]: Analyzing trace with hash 674802186, now seen corresponding path program 1 times [2019-09-20 13:25:38,547 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,548 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,549 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,549 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:38,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:38,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:38,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:38,628 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:38,628 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:38,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:38,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:38,629 INFO L87 Difference]: Start difference. First operand 46 states and 63 transitions. Second operand 6 states. [2019-09-20 13:25:38,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:38,875 INFO L93 Difference]: Finished difference Result 77 states and 112 transitions. [2019-09-20 13:25:38,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:38,876 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-09-20 13:25:38,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:38,878 INFO L225 Difference]: With dead ends: 77 [2019-09-20 13:25:38,878 INFO L226 Difference]: Without dead ends: 77 [2019-09-20 13:25:38,879 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-20 13:25:38,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-09-20 13:25:38,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 72. [2019-09-20 13:25:38,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-09-20 13:25:38,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 105 transitions. [2019-09-20 13:25:38,894 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 105 transitions. Word has length 14 [2019-09-20 13:25:38,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:38,894 INFO L475 AbstractCegarLoop]: Abstraction has 72 states and 105 transitions. [2019-09-20 13:25:38,895 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 105 transitions. [2019-09-20 13:25:38,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:38,896 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:38,896 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:38,898 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:38,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:38,898 INFO L82 PathProgramCache]: Analyzing trace with hash 1685485370, now seen corresponding path program 1 times [2019-09-20 13:25:38,898 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:38,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:38,901 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:38,901 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:38,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:39,026 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:25:39,027 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,027 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:39,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:39,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:25:39,028 INFO L87 Difference]: Start difference. First operand 72 states and 105 transitions. Second operand 7 states. [2019-09-20 13:25:39,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,290 INFO L93 Difference]: Finished difference Result 103 states and 154 transitions. [2019-09-20 13:25:39,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:39,291 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 19 [2019-09-20 13:25:39,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,293 INFO L225 Difference]: With dead ends: 103 [2019-09-20 13:25:39,293 INFO L226 Difference]: Without dead ends: 103 [2019-09-20 13:25:39,294 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:25:39,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2019-09-20 13:25:39,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2019-09-20 13:25:39,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-09-20 13:25:39,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 151 transitions. [2019-09-20 13:25:39,309 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 151 transitions. Word has length 19 [2019-09-20 13:25:39,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,310 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 151 transitions. [2019-09-20 13:25:39,310 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:39,310 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 151 transitions. [2019-09-20 13:25:39,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:39,312 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,312 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,312 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,313 INFO L82 PathProgramCache]: Analyzing trace with hash 2066847833, now seen corresponding path program 1 times [2019-09-20 13:25:39,313 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,315 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,316 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,316 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,370 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:39,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:25:39,371 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,371 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:25:39,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:25:39,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:25:39,372 INFO L87 Difference]: Start difference. First operand 100 states and 151 transitions. Second operand 5 states. [2019-09-20 13:25:39,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,445 INFO L93 Difference]: Finished difference Result 104 states and 154 transitions. [2019-09-20 13:25:39,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:25:39,446 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-09-20 13:25:39,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,452 INFO L225 Difference]: With dead ends: 104 [2019-09-20 13:25:39,452 INFO L226 Difference]: Without dead ends: 104 [2019-09-20 13:25:39,452 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-09-20 13:25:39,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-09-20 13:25:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2019-09-20 13:25:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2019-09-20 13:25:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 154 transitions. [2019-09-20 13:25:39,477 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 154 transitions. Word has length 19 [2019-09-20 13:25:39,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,478 INFO L475 AbstractCegarLoop]: Abstraction has 104 states and 154 transitions. [2019-09-20 13:25:39,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:25:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 154 transitions. [2019-09-20 13:25:39,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:39,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,480 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,480 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,480 INFO L82 PathProgramCache]: Analyzing trace with hash 2051845673, now seen corresponding path program 1 times [2019-09-20 13:25:39,481 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,482 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:39,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:39,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:39,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:39,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:39,571 INFO L87 Difference]: Start difference. First operand 104 states and 154 transitions. Second operand 6 states. [2019-09-20 13:25:39,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:39,803 INFO L93 Difference]: Finished difference Result 155 states and 238 transitions. [2019-09-20 13:25:39,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:25:39,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-20 13:25:39,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:39,806 INFO L225 Difference]: With dead ends: 155 [2019-09-20 13:25:39,806 INFO L226 Difference]: Without dead ends: 155 [2019-09-20 13:25:39,807 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-20 13:25:39,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2019-09-20 13:25:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 132. [2019-09-20 13:25:39,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-09-20 13:25:39,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 202 transitions. [2019-09-20 13:25:39,845 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 202 transitions. Word has length 19 [2019-09-20 13:25:39,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:39,846 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 202 transitions. [2019-09-20 13:25:39,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:39,846 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 202 transitions. [2019-09-20 13:25:39,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:39,848 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:39,849 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:39,849 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:39,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:39,851 INFO L82 PathProgramCache]: Analyzing trace with hash -2069937212, now seen corresponding path program 1 times [2019-09-20 13:25:39,851 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,853 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:39,854 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:39,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:39,913 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:39,914 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:39,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:39,914 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:39,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:39,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:39,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:39,915 INFO L87 Difference]: Start difference. First operand 132 states and 202 transitions. Second operand 6 states. [2019-09-20 13:25:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:40,087 INFO L93 Difference]: Finished difference Result 187 states and 289 transitions. [2019-09-20 13:25:40,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:25:40,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-09-20 13:25:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:40,092 INFO L225 Difference]: With dead ends: 187 [2019-09-20 13:25:40,093 INFO L226 Difference]: Without dead ends: 187 [2019-09-20 13:25:40,093 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-20 13:25:40,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2019-09-20 13:25:40,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 164. [2019-09-20 13:25:40,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-09-20 13:25:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 253 transitions. [2019-09-20 13:25:40,115 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 253 transitions. Word has length 19 [2019-09-20 13:25:40,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:40,115 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 253 transitions. [2019-09-20 13:25:40,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:40,116 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 253 transitions. [2019-09-20 13:25:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-09-20 13:25:40,117 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:40,118 INFO L407 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:40,118 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:40,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:40,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1098679356, now seen corresponding path program 1 times [2019-09-20 13:25:40,119 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:40,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:40,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:40,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:25:40,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:40,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:25:40,141 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:40,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:25:40,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:25:40,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:40,142 INFO L87 Difference]: Start difference. First operand 164 states and 253 transitions. Second operand 3 states. [2019-09-20 13:25:40,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:40,166 INFO L93 Difference]: Finished difference Result 232 states and 374 transitions. [2019-09-20 13:25:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:25:40,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-09-20 13:25:40,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:40,169 INFO L225 Difference]: With dead ends: 232 [2019-09-20 13:25:40,170 INFO L226 Difference]: Without dead ends: 232 [2019-09-20 13:25:40,170 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:25:40,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2019-09-20 13:25:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 194. [2019-09-20 13:25:40,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2019-09-20 13:25:40,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 306 transitions. [2019-09-20 13:25:40,190 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 306 transitions. Word has length 19 [2019-09-20 13:25:40,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:40,190 INFO L475 AbstractCegarLoop]: Abstraction has 194 states and 306 transitions. [2019-09-20 13:25:40,190 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:25:40,190 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 306 transitions. [2019-09-20 13:25:40,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-09-20 13:25:40,192 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:40,192 INFO L407 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] [2019-09-20 13:25:40,193 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:40,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:40,193 INFO L82 PathProgramCache]: Analyzing trace with hash -372123308, now seen corresponding path program 1 times [2019-09-20 13:25:40,193 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:40,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,195 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:40,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:40,278 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:25:40,279 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:40,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:25:40,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:40,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:40,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:40,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:25:40,281 INFO L87 Difference]: Start difference. First operand 194 states and 306 transitions. Second operand 6 states. [2019-09-20 13:25:40,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:40,433 INFO L93 Difference]: Finished difference Result 274 states and 446 transitions. [2019-09-20 13:25:40,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:40,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 26 [2019-09-20 13:25:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:40,439 INFO L225 Difference]: With dead ends: 274 [2019-09-20 13:25:40,439 INFO L226 Difference]: Without dead ends: 274 [2019-09-20 13:25:40,440 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-09-20 13:25:40,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2019-09-20 13:25:40,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 244. [2019-09-20 13:25:40,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 244 states. [2019-09-20 13:25:40,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 393 transitions. [2019-09-20 13:25:40,461 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 393 transitions. Word has length 26 [2019-09-20 13:25:40,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:40,461 INFO L475 AbstractCegarLoop]: Abstraction has 244 states and 393 transitions. [2019-09-20 13:25:40,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:40,462 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 393 transitions. [2019-09-20 13:25:40,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-20 13:25:40,463 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:40,463 INFO L407 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:40,464 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:40,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:40,464 INFO L82 PathProgramCache]: Analyzing trace with hash 348902212, now seen corresponding path program 1 times [2019-09-20 13:25:40,464 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:40,468 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:40,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:40,469 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:40,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:25:40,591 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:40,591 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:40,592 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 29 with the following transitions: [2019-09-20 13:25:40,594 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [29], [31], [34], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [117], [118], [119], [120] [2019-09-20 13:25:40,635 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:40,635 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:40,720 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:25:40,775 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:40,778 INFO L272 AbstractInterpreter]: Visited 23 different actions 33 times. Never merged. Never widened. Performed 40 root evaluator evaluations with a maximum evaluation depth of 8. Performed 40 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2019-09-20 13:25:40,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:40,784 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:40,784 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:40,785 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:40,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:40,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:40,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:25:40,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:40,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:40,947 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:25:40,947 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:41,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:25:41,004 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:25:41,005 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [10] total 15 [2019-09-20 13:25:41,005 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:41,005 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:41,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:41,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:25:41,006 INFO L87 Difference]: Start difference. First operand 244 states and 393 transitions. Second operand 7 states. [2019-09-20 13:25:41,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:41,203 INFO L93 Difference]: Finished difference Result 249 states and 397 transitions. [2019-09-20 13:25:41,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:25:41,204 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 28 [2019-09-20 13:25:41,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:41,206 INFO L225 Difference]: With dead ends: 249 [2019-09-20 13:25:41,206 INFO L226 Difference]: Without dead ends: 249 [2019-09-20 13:25:41,207 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:25:41,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-09-20 13:25:41,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 248. [2019-09-20 13:25:41,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2019-09-20 13:25:41,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 396 transitions. [2019-09-20 13:25:41,223 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 396 transitions. Word has length 28 [2019-09-20 13:25:41,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:41,223 INFO L475 AbstractCegarLoop]: Abstraction has 248 states and 396 transitions. [2019-09-20 13:25:41,223 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 396 transitions. [2019-09-20 13:25:41,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:25:41,224 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:41,225 INFO L407 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-09-20 13:25:41,225 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash -2096231521, now seen corresponding path program 1 times [2019-09-20 13:25:41,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:41,226 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:41,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,227 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:41,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:41,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:25:41,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:41,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:25:41,302 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:41,303 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:41,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:41,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:25:41,303 INFO L87 Difference]: Start difference. First operand 248 states and 396 transitions. Second operand 7 states. [2019-09-20 13:25:41,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:41,583 INFO L93 Difference]: Finished difference Result 415 states and 693 transitions. [2019-09-20 13:25:41,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:41,584 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 13:25:41,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:41,588 INFO L225 Difference]: With dead ends: 415 [2019-09-20 13:25:41,589 INFO L226 Difference]: Without dead ends: 415 [2019-09-20 13:25:41,589 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-20 13:25:41,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2019-09-20 13:25:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 371. [2019-09-20 13:25:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2019-09-20 13:25:41,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 617 transitions. [2019-09-20 13:25:41,615 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 617 transitions. Word has length 31 [2019-09-20 13:25:41,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:41,615 INFO L475 AbstractCegarLoop]: Abstraction has 371 states and 617 transitions. [2019-09-20 13:25:41,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:41,616 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 617 transitions. [2019-09-20 13:25:41,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:25:41,617 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:41,617 INFO L407 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-09-20 13:25:41,617 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:41,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:41,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1955682911, now seen corresponding path program 1 times [2019-09-20 13:25:41,618 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:41,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,620 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:41,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:41,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-09-20 13:25:41,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:41,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:25:41,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:41,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:41,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:41,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:25:41,693 INFO L87 Difference]: Start difference. First operand 371 states and 617 transitions. Second operand 7 states. [2019-09-20 13:25:41,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:41,962 INFO L93 Difference]: Finished difference Result 390 states and 646 transitions. [2019-09-20 13:25:41,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:41,962 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 31 [2019-09-20 13:25:41,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:41,966 INFO L225 Difference]: With dead ends: 390 [2019-09-20 13:25:41,966 INFO L226 Difference]: Without dead ends: 390 [2019-09-20 13:25:41,967 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:41,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2019-09-20 13:25:41,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 378. [2019-09-20 13:25:41,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-09-20 13:25:41,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 626 transitions. [2019-09-20 13:25:41,986 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 626 transitions. Word has length 31 [2019-09-20 13:25:41,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:41,987 INFO L475 AbstractCegarLoop]: Abstraction has 378 states and 626 transitions. [2019-09-20 13:25:41,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:41,987 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 626 transitions. [2019-09-20 13:25:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-20 13:25:41,988 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:41,988 INFO L407 BasicCegarLoop]: trace histogram [5, 4, 4, 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] [2019-09-20 13:25:41,989 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:41,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:41,989 INFO L82 PathProgramCache]: Analyzing trace with hash -1751188594, now seen corresponding path program 1 times [2019-09-20 13:25:41,989 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:41,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:41,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:41,991 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:41,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:42,056 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 13:25:42,057 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:42,057 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:42,057 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 41 with the following transitions: [2019-09-20 13:25:42,057 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [29], [31], [47], [51], [56], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [117], [118], [119], [120] [2019-09-20 13:25:42,060 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:42,060 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:42,066 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:25:42,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:42,100 INFO L272 AbstractInterpreter]: Visited 29 different actions 49 times. Never merged. Never widened. Performed 54 root evaluator evaluations with a maximum evaluation depth of 8. Performed 54 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 15 variables. [2019-09-20 13:25:42,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:42,100 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:42,100 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:42,100 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:42,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:42,132 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:42,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:42,153 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 9 conjunts are in the unsatisfiable core [2019-09-20 13:25:42,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:42,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-20 13:25:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 13:25:42,272 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:42,309 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-20 13:25:42,313 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:25:42,313 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [9] total 14 [2019-09-20 13:25:42,314 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:42,314 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:42,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:42,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2019-09-20 13:25:42,315 INFO L87 Difference]: Start difference. First operand 378 states and 626 transitions. Second operand 7 states. [2019-09-20 13:25:42,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:42,478 INFO L93 Difference]: Finished difference Result 438 states and 725 transitions. [2019-09-20 13:25:42,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:42,479 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-09-20 13:25:42,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:42,483 INFO L225 Difference]: With dead ends: 438 [2019-09-20 13:25:42,483 INFO L226 Difference]: Without dead ends: 438 [2019-09-20 13:25:42,484 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2019-09-20 13:25:42,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2019-09-20 13:25:42,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 382. [2019-09-20 13:25:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-09-20 13:25:42,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 629 transitions. [2019-09-20 13:25:42,506 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 629 transitions. Word has length 40 [2019-09-20 13:25:42,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:42,506 INFO L475 AbstractCegarLoop]: Abstraction has 382 states and 629 transitions. [2019-09-20 13:25:42,506 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:42,506 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 629 transitions. [2019-09-20 13:25:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-20 13:25:42,508 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:42,508 INFO L407 BasicCegarLoop]: trace histogram [6, 5, 5, 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-09-20 13:25:42,508 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:42,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:42,509 INFO L82 PathProgramCache]: Analyzing trace with hash 454341926, now seen corresponding path program 1 times [2019-09-20 13:25:42,509 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:42,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:42,510 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:42,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:42,511 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:42,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:42,568 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-09-20 13:25:42,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:25:42,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-20 13:25:42,568 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:42,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-20 13:25:42,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-20 13:25:42,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:25:42,570 INFO L87 Difference]: Start difference. First operand 382 states and 629 transitions. Second operand 7 states. [2019-09-20 13:25:42,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:42,779 INFO L93 Difference]: Finished difference Result 433 states and 699 transitions. [2019-09-20 13:25:42,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:25:42,780 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-09-20 13:25:42,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:42,783 INFO L225 Difference]: With dead ends: 433 [2019-09-20 13:25:42,784 INFO L226 Difference]: Without dead ends: 433 [2019-09-20 13:25:42,784 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:25:42,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2019-09-20 13:25:42,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 312. [2019-09-20 13:25:42,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-20 13:25:42,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 499 transitions. [2019-09-20 13:25:42,802 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 499 transitions. Word has length 41 [2019-09-20 13:25:42,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:42,802 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 499 transitions. [2019-09-20 13:25:42,802 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-20 13:25:42,802 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 499 transitions. [2019-09-20 13:25:42,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-20 13:25:42,804 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:42,804 INFO L407 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:25:42,805 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:42,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:42,805 INFO L82 PathProgramCache]: Analyzing trace with hash 867583944, now seen corresponding path program 1 times [2019-09-20 13:25:42,805 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:42,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:42,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:42,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:42,807 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:42,923 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-20 13:25:42,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:42,923 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:42,924 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 62 with the following transitions: [2019-09-20 13:25:42,924 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [47], [51], [56], [61], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116] [2019-09-20 13:25:42,927 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:42,927 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:42,932 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:25:43,051 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:43,052 INFO L272 AbstractInterpreter]: Visited 30 different actions 102 times. Merged at 11 different actions 11 times. Never widened. Performed 119 root evaluator evaluations with a maximum evaluation depth of 8. Performed 119 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 1 fixpoints after 1 different actions. Largest state had 14 variables. [2019-09-20 13:25:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:43,052 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:43,052 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:43,052 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-20 13:25:43,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:43,082 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:43,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-20 13:25:43,109 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:43,226 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-09-20 13:25:43,226 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:25:43,370 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 22 proven. 1 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-20 13:25:43,374 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-09-20 13:25:43,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [9, 6] total 15 [2019-09-20 13:25:43,375 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:25:43,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:25:43,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:25:43,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2019-09-20 13:25:43,376 INFO L87 Difference]: Start difference. First operand 312 states and 499 transitions. Second operand 6 states. [2019-09-20 13:25:43,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:25:43,643 INFO L93 Difference]: Finished difference Result 395 states and 634 transitions. [2019-09-20 13:25:43,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-20 13:25:43,644 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-09-20 13:25:43,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:25:43,647 INFO L225 Difference]: With dead ends: 395 [2019-09-20 13:25:43,647 INFO L226 Difference]: Without dead ends: 395 [2019-09-20 13:25:43,648 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-09-20 13:25:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-09-20 13:25:43,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 360. [2019-09-20 13:25:43,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2019-09-20 13:25:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 583 transitions. [2019-09-20 13:25:43,664 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 583 transitions. Word has length 61 [2019-09-20 13:25:43,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:25:43,664 INFO L475 AbstractCegarLoop]: Abstraction has 360 states and 583 transitions. [2019-09-20 13:25:43,664 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:25:43,664 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 583 transitions. [2019-09-20 13:25:43,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-20 13:25:43,666 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:25:43,667 INFO L407 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-20 13:25:43,667 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:25:43,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:43,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1184410446, now seen corresponding path program 1 times [2019-09-20 13:25:43,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:25:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:43,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:43,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:25:43,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:25:43,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:43,780 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 20 proven. 10 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-20 13:25:43,780 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:43,780 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:25:43,781 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 76 with the following transitions: [2019-09-20 13:25:43,781 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [29], [31], [47], [51], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-20 13:25:43,784 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:25:43,784 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:25:43,788 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:25:43,844 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:25:43,844 INFO L272 AbstractInterpreter]: Visited 37 different actions 136 times. Merged at 15 different actions 15 times. Never widened. Performed 159 root evaluator evaluations with a maximum evaluation depth of 8. Performed 159 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 3 fixpoints after 2 different actions. Largest state had 15 variables. [2019-09-20 13:25:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:25:43,845 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:25:43,845 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:25:43,845 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:25:43,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:25:43,873 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:25:43,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:25:43,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 7 conjunts are in the unsatisfiable core [2019-09-20 13:25:43,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:25:44,096 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 88 proven. 2 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-20 13:25:44,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:06,994 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 27 proven. 3 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2019-09-20 13:26:06,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 8, 8] total 25 [2019-09-20 13:26:06,998 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:06,998 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:26:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:26:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=528, Unknown=8, NotChecked=0, Total=600 [2019-09-20 13:26:07,000 INFO L87 Difference]: Start difference. First operand 360 states and 583 transitions. Second operand 19 states. [2019-09-20 13:26:16,714 WARN L191 SmtUtils]: Spent 472.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-09-20 13:26:19,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:26:19,531 INFO L93 Difference]: Finished difference Result 656 states and 1020 transitions. [2019-09-20 13:26:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-09-20 13:26:19,532 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 75 [2019-09-20 13:26:19,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:26:19,535 INFO L225 Difference]: With dead ends: 656 [2019-09-20 13:26:19,535 INFO L226 Difference]: Without dead ends: 379 [2019-09-20 13:26:19,537 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 31.1s TimeCoverageRelationStatistics Valid=760, Invalid=4060, Unknown=10, NotChecked=0, Total=4830 [2019-09-20 13:26:19,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2019-09-20 13:26:19,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 210. [2019-09-20 13:26:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2019-09-20 13:26:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 308 transitions. [2019-09-20 13:26:19,556 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 308 transitions. Word has length 75 [2019-09-20 13:26:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:26:19,557 INFO L475 AbstractCegarLoop]: Abstraction has 210 states and 308 transitions. [2019-09-20 13:26:19,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-09-20 13:26:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 308 transitions. [2019-09-20 13:26:19,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-09-20 13:26:19,558 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:26:19,559 INFO L407 BasicCegarLoop]: trace histogram [17, 16, 16, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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, 1, 1, 1] [2019-09-20 13:26:19,559 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:26:19,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:19,559 INFO L82 PathProgramCache]: Analyzing trace with hash -16221646, now seen corresponding path program 1 times [2019-09-20 13:26:19,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:26:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:19,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:19,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:26:19,561 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:26:19,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:19,686 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 33 proven. 19 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-09-20 13:26:19,686 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:19,687 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:26:19,687 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 111 with the following transitions: [2019-09-20 13:26:19,687 INFO L207 CegarAbsIntRunner]: [0], [4], [8], [11], [22], [31], [34], [39], [42], [47], [51], [54], [56], [61], [67], [70], [82], [85], [87], [90], [92], [93], [94], [95], [97], [98], [99], [100], [101], [102], [103], [104], [105], [106], [107], [108], [109], [110], [111], [112], [113], [114], [115], [116], [117], [118], [119], [120] [2019-09-20 13:26:19,691 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:26:19,691 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:26:19,697 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2019-09-20 13:26:19,774 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-09-20 13:26:19,775 INFO L272 AbstractInterpreter]: Visited 48 different actions 198 times. Merged at 21 different actions 21 times. Never widened. Performed 230 root evaluator evaluations with a maximum evaluation depth of 8. Performed 230 inverse root evaluator evaluations with a maximum inverse evaluation depth of 8. Found 5 fixpoints after 3 different actions. Largest state had 16 variables. [2019-09-20 13:26:19,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:26:19,775 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-09-20 13:26:19,775 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:26:19,776 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-20 13:26:19,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:26:19,812 INFO L289 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2019-09-20 13:26:19,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:26:19,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-20 13:26:19,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-20 13:26:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 153 proven. 7 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2019-09-20 13:26:20,096 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-09-20 13:26:22,961 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 44 proven. 8 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (6)] Exception during sending of exit command (exit): Broken pipe [2019-09-20 13:26:22,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2019-09-20 13:26:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 9] total 26 [2019-09-20 13:26:22,966 INFO L250 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2019-09-20 13:26:22,967 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-09-20 13:26:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-09-20 13:26:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=578, Unknown=1, NotChecked=0, Total=650 [2019-09-20 13:26:22,968 INFO L87 Difference]: Start difference. First operand 210 states and 308 transitions. Second operand 19 states.