java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:05:31,925 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:05:31,928 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:05:31,945 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:05:31,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:05:31,947 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:05:31,949 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:05:31,962 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:05:31,964 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:05:31,965 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:05:31,966 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:05:31,968 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:05:31,969 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:05:31,972 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:05:31,974 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:05:31,976 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:05:31,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:05:31,982 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:05:31,984 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:05:31,989 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:05:31,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:05:31,994 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:05:31,996 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:05:31,997 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:05:32,001 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:05:32,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:05:32,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:05:32,004 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:05:32,005 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:05:32,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:05:32,007 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:05:32,008 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:05:32,009 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:05:32,009 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:05:32,013 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:05:32,014 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:05:32,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:05:32,015 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:05:32,015 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:05:32,016 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:05:32,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:05:32,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:05:32,036 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:05:32,036 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:05:32,039 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:05:32,039 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:05:32,039 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:05:32,039 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:05:32,040 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:05:32,040 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:05:32,040 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:05:32,040 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:05:32,041 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:05:32,041 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:05:32,042 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:05:32,042 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:05:32,042 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:05:32,043 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:05:32,043 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:05:32,043 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:05:32,043 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:05:32,043 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:05:32,044 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:05:32,044 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:32,044 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:05:32,044 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:05:32,044 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:05:32,045 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:05:32,045 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:05:32,045 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:05:32,045 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:05:32,331 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:05:32,345 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:05:32,348 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:05:32,350 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:05:32,350 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:05:32,351 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-15 01:05:32,413 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c548afcad/7e98012f4d624881b44399cb31cb72c7/FLAG12bdb3f8e [2019-10-15 01:05:32,922 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:05:32,923 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gj2007.c.i.p+nlh-reducer.c [2019-10-15 01:05:32,938 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c548afcad/7e98012f4d624881b44399cb31cb72c7/FLAG12bdb3f8e [2019-10-15 01:05:33,248 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c548afcad/7e98012f4d624881b44399cb31cb72c7 [2019-10-15 01:05:33,259 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:05:33,261 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:05:33,262 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:33,262 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:05:33,266 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:05:33,267 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,270 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39589b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33, skipping insertion in model container [2019-10-15 01:05:33,270 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,278 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:05:33,333 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:05:33,672 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:33,679 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:05:33,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:05:33,890 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:05:33,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33 WrapperNode [2019-10-15 01:05:33,891 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:05:33,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:05:33,891 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:05:33,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:05:33,901 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,902 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,924 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,938 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,943 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... [2019-10-15 01:05:33,950 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:05:33,957 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:05:33,958 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:05:33,958 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:05:33,960 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:05:34,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:05:34,016 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:05:34,016 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:05:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:05:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:05:34,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-15 01:05:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:05:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:05:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:05:34,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:05:34,899 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:05:34,899 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:05:34,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:34 BoogieIcfgContainer [2019-10-15 01:05:34,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:05:34,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:05:34,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:05:34,906 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:05:34,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:05:33" (1/3) ... [2019-10-15 01:05:34,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74949842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:34, skipping insertion in model container [2019-10-15 01:05:34,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:05:33" (2/3) ... [2019-10-15 01:05:34,908 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74949842 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:05:34, skipping insertion in model container [2019-10-15 01:05:34,908 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:05:34" (3/3) ... [2019-10-15 01:05:34,910 INFO L109 eAbstractionObserver]: Analyzing ICFG gj2007.c.i.p+nlh-reducer.c [2019-10-15 01:05:34,918 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:05:34,927 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:05:34,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:05:34,965 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:05:34,965 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:05:34,965 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:05:34,966 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:05:34,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:05:34,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:05:34,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:05:34,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:05:34,989 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states. [2019-10-15 01:05:35,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:35,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:35,004 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:35,006 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:35,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:35,010 INFO L82 PathProgramCache]: Analyzing trace with hash -1537709744, now seen corresponding path program 1 times [2019-10-15 01:05:35,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:35,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974975487] [2019-10-15 01:05:35,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:35,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:35,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:35,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:35,259 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974975487] [2019-10-15 01:05:35,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:35,260 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:35,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889658357] [2019-10-15 01:05:35,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:35,268 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:35,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:35,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:35,286 INFO L87 Difference]: Start difference. First operand 149 states. Second operand 3 states. [2019-10-15 01:05:35,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:35,886 INFO L93 Difference]: Finished difference Result 290 states and 560 transitions. [2019-10-15 01:05:35,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:35,888 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-15 01:05:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:35,911 INFO L225 Difference]: With dead ends: 290 [2019-10-15 01:05:35,911 INFO L226 Difference]: Without dead ends: 145 [2019-10-15 01:05:35,920 INFO L600 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-10-15 01:05:35,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2019-10-15 01:05:35,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2019-10-15 01:05:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2019-10-15 01:05:36,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 212 transitions. [2019-10-15 01:05:36,006 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 212 transitions. Word has length 143 [2019-10-15 01:05:36,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:36,007 INFO L462 AbstractCegarLoop]: Abstraction has 145 states and 212 transitions. [2019-10-15 01:05:36,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:36,008 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 212 transitions. [2019-10-15 01:05:36,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:36,021 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:36,022 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:36,022 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:36,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:36,024 INFO L82 PathProgramCache]: Analyzing trace with hash 470480343, now seen corresponding path program 1 times [2019-10-15 01:05:36,025 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:36,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047403327] [2019-10-15 01:05:36,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:36,025 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:36,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:36,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:36,173 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:36,173 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047403327] [2019-10-15 01:05:36,174 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:36,174 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:05:36,174 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837959376] [2019-10-15 01:05:36,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:05:36,177 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:36,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:05:36,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:05:36,178 INFO L87 Difference]: Start difference. First operand 145 states and 212 transitions. Second operand 3 states. [2019-10-15 01:05:36,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:36,792 INFO L93 Difference]: Finished difference Result 410 states and 609 transitions. [2019-10-15 01:05:36,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:05:36,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 143 [2019-10-15 01:05:36,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:36,801 INFO L225 Difference]: With dead ends: 410 [2019-10-15 01:05:36,801 INFO L226 Difference]: Without dead ends: 277 [2019-10-15 01:05:36,804 INFO L600 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-10-15 01:05:36,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2019-10-15 01:05:36,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2019-10-15 01:05:36,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2019-10-15 01:05:36,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 345 transitions. [2019-10-15 01:05:36,839 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 345 transitions. Word has length 143 [2019-10-15 01:05:36,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:36,840 INFO L462 AbstractCegarLoop]: Abstraction has 277 states and 345 transitions. [2019-10-15 01:05:36,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:05:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 345 transitions. [2019-10-15 01:05:36,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:36,842 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:36,842 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:36,843 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:36,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:36,843 INFO L82 PathProgramCache]: Analyzing trace with hash 859387544, now seen corresponding path program 1 times [2019-10-15 01:05:36,843 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:36,844 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446879555] [2019-10-15 01:05:36,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:36,844 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:36,844 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:39,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:39,243 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446879555] [2019-10-15 01:05:39,243 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:39,244 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:39,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621200374] [2019-10-15 01:05:39,245 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:39,245 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:39,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:39,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:39,249 INFO L87 Difference]: Start difference. First operand 277 states and 345 transitions. Second operand 69 states. [2019-10-15 01:05:40,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:40,304 INFO L93 Difference]: Finished difference Result 404 states and 472 transitions. [2019-10-15 01:05:40,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:05:40,306 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:40,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:40,308 INFO L225 Difference]: With dead ends: 404 [2019-10-15 01:05:40,308 INFO L226 Difference]: Without dead ends: 269 [2019-10-15 01:05:40,311 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 248 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2036, Invalid=2656, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:40,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2019-10-15 01:05:40,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2019-10-15 01:05:40,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2019-10-15 01:05:40,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 333 transitions. [2019-10-15 01:05:40,336 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 333 transitions. Word has length 143 [2019-10-15 01:05:40,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:40,336 INFO L462 AbstractCegarLoop]: Abstraction has 269 states and 333 transitions. [2019-10-15 01:05:40,336 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:40,336 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 333 transitions. [2019-10-15 01:05:40,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:40,338 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:40,339 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:40,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:40,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:40,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1284631305, now seen corresponding path program 1 times [2019-10-15 01:05:40,340 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:40,340 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389247302] [2019-10-15 01:05:40,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:40,340 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:40,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:40,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:42,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:42,516 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389247302] [2019-10-15 01:05:42,516 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:42,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:42,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236180486] [2019-10-15 01:05:42,517 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:42,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:42,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:42,526 INFO L87 Difference]: Start difference. First operand 269 states and 333 transitions. Second operand 69 states. [2019-10-15 01:05:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:43,610 INFO L93 Difference]: Finished difference Result 394 states and 458 transitions. [2019-10-15 01:05:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 01:05:43,611 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:43,614 INFO L225 Difference]: With dead ends: 394 [2019-10-15 01:05:43,614 INFO L226 Difference]: Without dead ends: 267 [2019-10-15 01:05:43,616 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 305 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1980, Invalid=2712, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:43,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2019-10-15 01:05:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2019-10-15 01:05:43,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2019-10-15 01:05:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 330 transitions. [2019-10-15 01:05:43,628 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 330 transitions. Word has length 143 [2019-10-15 01:05:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:43,628 INFO L462 AbstractCegarLoop]: Abstraction has 267 states and 330 transitions. [2019-10-15 01:05:43,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 330 transitions. [2019-10-15 01:05:43,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:43,630 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:43,631 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:43,631 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:43,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:43,631 INFO L82 PathProgramCache]: Analyzing trace with hash 698919756, now seen corresponding path program 1 times [2019-10-15 01:05:43,631 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:43,632 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888547363] [2019-10-15 01:05:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:43,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:43,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:45,378 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888547363] [2019-10-15 01:05:45,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:45,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:45,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529661782] [2019-10-15 01:05:45,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:45,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:45,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:45,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:45,383 INFO L87 Difference]: Start difference. First operand 267 states and 330 transitions. Second operand 69 states. [2019-10-15 01:05:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:46,577 INFO L93 Difference]: Finished difference Result 390 states and 453 transitions. [2019-10-15 01:05:46,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:05:46,578 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:46,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:46,580 INFO L225 Difference]: With dead ends: 390 [2019-10-15 01:05:46,580 INFO L226 Difference]: Without dead ends: 265 [2019-10-15 01:05:46,583 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1926, Invalid=2766, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:46,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2019-10-15 01:05:46,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2019-10-15 01:05:46,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2019-10-15 01:05:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 327 transitions. [2019-10-15 01:05:46,593 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 327 transitions. Word has length 143 [2019-10-15 01:05:46,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:46,593 INFO L462 AbstractCegarLoop]: Abstraction has 265 states and 327 transitions. [2019-10-15 01:05:46,594 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 327 transitions. [2019-10-15 01:05:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:46,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:46,596 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:46,596 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:46,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:46,597 INFO L82 PathProgramCache]: Analyzing trace with hash 2054450191, now seen corresponding path program 1 times [2019-10-15 01:05:46,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:46,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260254218] [2019-10-15 01:05:46,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:46,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:46,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:48,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:48,252 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260254218] [2019-10-15 01:05:48,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:48,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:48,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468299432] [2019-10-15 01:05:48,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:48,254 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:48,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:48,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:48,256 INFO L87 Difference]: Start difference. First operand 265 states and 327 transitions. Second operand 69 states. [2019-10-15 01:05:49,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:49,620 INFO L93 Difference]: Finished difference Result 382 states and 444 transitions. [2019-10-15 01:05:49,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 01:05:49,621 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:49,623 INFO L225 Difference]: With dead ends: 382 [2019-10-15 01:05:49,623 INFO L226 Difference]: Without dead ends: 259 [2019-10-15 01:05:49,625 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1776, Invalid=2916, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:49,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2019-10-15 01:05:49,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2019-10-15 01:05:49,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2019-10-15 01:05:49,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 318 transitions. [2019-10-15 01:05:49,634 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 318 transitions. Word has length 143 [2019-10-15 01:05:49,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:49,635 INFO L462 AbstractCegarLoop]: Abstraction has 259 states and 318 transitions. [2019-10-15 01:05:49,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:49,635 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 318 transitions. [2019-10-15 01:05:49,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:49,637 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:49,637 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:49,637 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:49,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:49,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1013609311, now seen corresponding path program 1 times [2019-10-15 01:05:49,638 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:49,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495423324] [2019-10-15 01:05:49,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:49,638 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:49,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:49,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:51,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:51,271 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495423324] [2019-10-15 01:05:51,271 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:51,271 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:51,271 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084880853] [2019-10-15 01:05:51,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:51,272 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:51,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:51,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:51,274 INFO L87 Difference]: Start difference. First operand 259 states and 318 transitions. Second operand 69 states. [2019-10-15 01:05:52,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:52,757 INFO L93 Difference]: Finished difference Result 372 states and 431 transitions. [2019-10-15 01:05:52,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:05:52,757 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:52,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:52,760 INFO L225 Difference]: With dead ends: 372 [2019-10-15 01:05:52,760 INFO L226 Difference]: Without dead ends: 255 [2019-10-15 01:05:52,762 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 605 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1686, Invalid=3006, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:52,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2019-10-15 01:05:52,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2019-10-15 01:05:52,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2019-10-15 01:05:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 312 transitions. [2019-10-15 01:05:52,770 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 312 transitions. Word has length 143 [2019-10-15 01:05:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:52,771 INFO L462 AbstractCegarLoop]: Abstraction has 255 states and 312 transitions. [2019-10-15 01:05:52,771 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 312 transitions. [2019-10-15 01:05:52,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:52,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:52,773 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:52,773 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:52,774 INFO L82 PathProgramCache]: Analyzing trace with hash 560132216, now seen corresponding path program 1 times [2019-10-15 01:05:52,774 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:52,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571599864] [2019-10-15 01:05:52,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:52,774 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:52,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:54,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:54,397 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571599864] [2019-10-15 01:05:54,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:54,397 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:54,397 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333764740] [2019-10-15 01:05:54,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:54,398 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:54,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:54,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:54,400 INFO L87 Difference]: Start difference. First operand 255 states and 312 transitions. Second operand 69 states. [2019-10-15 01:05:55,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:55,717 INFO L93 Difference]: Finished difference Result 366 states and 423 transitions. [2019-10-15 01:05:55,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-15 01:05:55,718 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:55,720 INFO L225 Difference]: With dead ends: 366 [2019-10-15 01:05:55,720 INFO L226 Difference]: Without dead ends: 253 [2019-10-15 01:05:55,722 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 648 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1644, Invalid=3048, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:55,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2019-10-15 01:05:55,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2019-10-15 01:05:55,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2019-10-15 01:05:55,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 309 transitions. [2019-10-15 01:05:55,730 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 309 transitions. Word has length 143 [2019-10-15 01:05:55,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:55,730 INFO L462 AbstractCegarLoop]: Abstraction has 253 states and 309 transitions. [2019-10-15 01:05:55,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:55,731 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 309 transitions. [2019-10-15 01:05:55,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:55,732 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:55,732 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:55,733 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:55,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:55,733 INFO L82 PathProgramCache]: Analyzing trace with hash 752755852, now seen corresponding path program 1 times [2019-10-15 01:05:55,733 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:55,734 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014786140] [2019-10-15 01:05:55,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:55,734 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:55,734 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:55,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:05:57,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:05:57,260 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014786140] [2019-10-15 01:05:57,260 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:05:57,261 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:05:57,261 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465930169] [2019-10-15 01:05:57,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:05:57,262 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:05:57,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:05:57,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:57,264 INFO L87 Difference]: Start difference. First operand 253 states and 309 transitions. Second operand 69 states. [2019-10-15 01:05:59,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:05:59,100 INFO L93 Difference]: Finished difference Result 360 states and 416 transitions. [2019-10-15 01:05:59,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-15 01:05:59,101 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:05:59,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:05:59,102 INFO L225 Difference]: With dead ends: 360 [2019-10-15 01:05:59,103 INFO L226 Difference]: Without dead ends: 249 [2019-10-15 01:05:59,104 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 728 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1566, Invalid=3126, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:05:59,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2019-10-15 01:05:59,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2019-10-15 01:05:59,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2019-10-15 01:05:59,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 303 transitions. [2019-10-15 01:05:59,112 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 303 transitions. Word has length 143 [2019-10-15 01:05:59,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:05:59,112 INFO L462 AbstractCegarLoop]: Abstraction has 249 states and 303 transitions. [2019-10-15 01:05:59,112 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:05:59,112 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 303 transitions. [2019-10-15 01:05:59,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:05:59,114 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:05:59,114 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:05:59,114 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:05:59,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:05:59,114 INFO L82 PathProgramCache]: Analyzing trace with hash -553376648, now seen corresponding path program 1 times [2019-10-15 01:05:59,115 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:05:59,115 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088586345] [2019-10-15 01:05:59,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:59,115 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:05:59,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:05:59,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:00,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:00,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088586345] [2019-10-15 01:06:00,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:00,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2019-10-15 01:06:00,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777345849] [2019-10-15 01:06:00,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 69 states [2019-10-15 01:06:00,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:00,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2019-10-15 01:06:00,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:06:00,879 INFO L87 Difference]: Start difference. First operand 249 states and 303 transitions. Second operand 69 states. [2019-10-15 01:06:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:02,790 INFO L93 Difference]: Finished difference Result 352 states and 406 transitions. [2019-10-15 01:06:02,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-15 01:06:02,791 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 143 [2019-10-15 01:06:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:02,794 INFO L225 Difference]: With dead ends: 352 [2019-10-15 01:06:02,794 INFO L226 Difference]: Without dead ends: 245 [2019-10-15 01:06:02,795 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1496, Invalid=3196, Unknown=0, NotChecked=0, Total=4692 [2019-10-15 01:06:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2019-10-15 01:06:02,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2019-10-15 01:06:02,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2019-10-15 01:06:02,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 297 transitions. [2019-10-15 01:06:02,803 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 297 transitions. Word has length 143 [2019-10-15 01:06:02,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:02,803 INFO L462 AbstractCegarLoop]: Abstraction has 245 states and 297 transitions. [2019-10-15 01:06:02,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 69 states. [2019-10-15 01:06:02,803 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 297 transitions. [2019-10-15 01:06:02,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-15 01:06:02,804 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:02,805 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1] [2019-10-15 01:06:02,805 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:02,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:02,805 INFO L82 PathProgramCache]: Analyzing trace with hash 1465640920, now seen corresponding path program 1 times [2019-10-15 01:06:02,805 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:02,806 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415605427] [2019-10-15 01:06:02,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:02,806 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:02,806 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:02,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:06:04,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:06:04,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415605427] [2019-10-15 01:06:04,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:06:04,867 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [70] imperfect sequences [] total 70 [2019-10-15 01:06:04,867 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475453685] [2019-10-15 01:06:04,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 70 states [2019-10-15 01:06:04,868 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:06:04,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2019-10-15 01:06:04,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:06:04,869 INFO L87 Difference]: Start difference. First operand 245 states and 297 transitions. Second operand 70 states. [2019-10-15 01:06:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:06:10,995 INFO L93 Difference]: Finished difference Result 556 states and 625 transitions. [2019-10-15 01:06:10,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2019-10-15 01:06:10,996 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 143 [2019-10-15 01:06:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:06:10,999 INFO L225 Difference]: With dead ends: 556 [2019-10-15 01:06:10,999 INFO L226 Difference]: Without dead ends: 453 [2019-10-15 01:06:11,000 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2019-10-15 01:06:11,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 453 states. [2019-10-15 01:06:11,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 453 to 452. [2019-10-15 01:06:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2019-10-15 01:06:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 470 transitions. [2019-10-15 01:06:11,015 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 470 transitions. Word has length 143 [2019-10-15 01:06:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:06:11,015 INFO L462 AbstractCegarLoop]: Abstraction has 452 states and 470 transitions. [2019-10-15 01:06:11,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 70 states. [2019-10-15 01:06:11,016 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 470 transitions. [2019-10-15 01:06:11,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-15 01:06:11,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:06:11,017 INFO L380 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 1, 1, 1, 1, 1] [2019-10-15 01:06:11,018 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:06:11,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:06:11,018 INFO L82 PathProgramCache]: Analyzing trace with hash -87860138, now seen corresponding path program 1 times [2019-10-15 01:06:11,018 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:06:11,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295190112] [2019-10-15 01:06:11,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:11,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:06:11,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:06:11,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat