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/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:23:12,816 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:23:12,818 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:23:12,830 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:23:12,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:23:12,832 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:23:12,833 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:23:12,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:23:12,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:23:12,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:23:12,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:23:12,839 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:23:12,839 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:23:12,840 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:23:12,841 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:23:12,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:23:12,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:23:12,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:23:12,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:23:12,848 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:23:12,849 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:23:12,850 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:23:12,851 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:23:12,852 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:23:12,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:23:12,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:23:12,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:23:12,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:23:12,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:23:12,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:23:12,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:23:12,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:23:12,859 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:23:12,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:23:12,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:23:12,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:23:12,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:23:12,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:23:12,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:23:12,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:23:12,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:23:12,864 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:23:12,878 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:23:12,879 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:23:12,880 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:23:12,880 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:23:12,880 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:23:12,880 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:23:12,881 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:23:12,881 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:23:12,881 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:23:12,881 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:23:12,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:23:12,882 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:23:12,882 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:23:12,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:23:12,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:23:12,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:23:12,883 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:23:12,883 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:23:12,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:23:12,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:23:12,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:23:12,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:23:12,884 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:23:12,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:23:12,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:23:12,885 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:23:12,885 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:23:12,885 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:23:12,885 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:23:13,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:23:13,191 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:23:13,195 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:23:13,196 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:23:13,197 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:23:13,197 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:13,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf59fd1b/7755cdb2916a4575a1076b3947d23976/FLAGee5ae5ab6 [2019-10-15 01:23:13,886 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:23:13,887 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:13,914 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf59fd1b/7755cdb2916a4575a1076b3947d23976/FLAGee5ae5ab6 [2019-10-15 01:23:14,074 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/abf59fd1b/7755cdb2916a4575a1076b3947d23976 [2019-10-15 01:23:14,085 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:23:14,087 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:23:14,088 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:14,088 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:23:14,094 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:23:14,095 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55e6f66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:14, skipping insertion in model container [2019-10-15 01:23:14,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:23:14" (1/1) ... [2019-10-15 01:23:14,107 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:23:14,206 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:23:14,943 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:14,987 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:23:15,321 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:23:15,350 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:23:15,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15 WrapperNode [2019-10-15 01:23:15,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:23:15,352 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:23:15,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:23:15,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,365 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,391 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,392 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,453 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,489 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (1/1) ... [2019-10-15 01:23:15,516 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:23:15,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:23:15,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:23:15,517 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:23:15,518 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (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:23:15,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:23:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:23:15,599 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:23:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:23:15,599 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 01:23:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 01:23:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 01:23:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 01:23:15,600 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 01:23:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 01:23:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 01:23:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 01:23:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 01:23:15,601 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 01:23:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 01:23:15,602 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 01:23:15,604 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:23:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:23:15,605 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:23:17,765 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:23:17,767 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 01:23:17,769 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:17 BoogieIcfgContainer [2019-10-15 01:23:17,769 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:23:17,770 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:23:17,770 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:23:17,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:23:17,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:23:14" (1/3) ... [2019-10-15 01:23:17,775 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c21cb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:17, skipping insertion in model container [2019-10-15 01:23:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:23:15" (2/3) ... [2019-10-15 01:23:17,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c21cb7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:23:17, skipping insertion in model container [2019-10-15 01:23:17,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:23:17" (3/3) ... [2019-10-15 01:23:17,783 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 01:23:17,795 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:23:17,823 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-15 01:23:17,840 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-15 01:23:17,883 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:23:17,884 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:23:17,884 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:23:17,884 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:23:17,884 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:23:17,884 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:23:17,884 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:23:17,885 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:23:17,932 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states. [2019-10-15 01:23:17,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:23:17,949 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:17,950 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] [2019-10-15 01:23:17,952 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:17,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:17,958 INFO L82 PathProgramCache]: Analyzing trace with hash -437253728, now seen corresponding path program 1 times [2019-10-15 01:23:17,965 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:17,965 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087448245] [2019-10-15 01:23:17,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,965 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:17,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:18,488 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:23:18,489 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087448245] [2019-10-15 01:23:18,490 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:18,490 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:18,491 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981150575] [2019-10-15 01:23:18,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:18,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:18,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:18,515 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:18,517 INFO L87 Difference]: Start difference. First operand 446 states. Second operand 3 states. [2019-10-15 01:23:18,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:18,694 INFO L93 Difference]: Finished difference Result 701 states and 1229 transitions. [2019-10-15 01:23:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:18,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-15 01:23:18,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:18,726 INFO L225 Difference]: With dead ends: 701 [2019-10-15 01:23:18,727 INFO L226 Difference]: Without dead ends: 544 [2019-10-15 01:23:18,734 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:23:18,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-10-15 01:23:18,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 538. [2019-10-15 01:23:18,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 538 states. [2019-10-15 01:23:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 713 transitions. [2019-10-15 01:23:18,862 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 713 transitions. Word has length 53 [2019-10-15 01:23:18,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:18,863 INFO L462 AbstractCegarLoop]: Abstraction has 538 states and 713 transitions. [2019-10-15 01:23:18,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:18,863 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 713 transitions. [2019-10-15 01:23:18,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:23:18,875 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:18,875 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] [2019-10-15 01:23:18,875 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:18,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:18,877 INFO L82 PathProgramCache]: Analyzing trace with hash 511312781, now seen corresponding path program 1 times [2019-10-15 01:23:18,877 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:18,877 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467192563] [2019-10-15 01:23:18,877 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,879 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:18,879 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:18,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:19,087 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:23:19,089 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467192563] [2019-10-15 01:23:19,089 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:19,089 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:19,089 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580063061] [2019-10-15 01:23:19,091 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:19,092 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:19,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:19,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:19,093 INFO L87 Difference]: Start difference. First operand 538 states and 713 transitions. Second operand 3 states. [2019-10-15 01:23:19,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:19,166 INFO L93 Difference]: Finished difference Result 939 states and 1299 transitions. [2019-10-15 01:23:19,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:19,167 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-15 01:23:19,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:19,171 INFO L225 Difference]: With dead ends: 939 [2019-10-15 01:23:19,171 INFO L226 Difference]: Without dead ends: 717 [2019-10-15 01:23:19,174 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:23:19,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 717 states. [2019-10-15 01:23:19,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 717 to 711. [2019-10-15 01:23:19,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2019-10-15 01:23:19,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 964 transitions. [2019-10-15 01:23:19,199 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 964 transitions. Word has length 53 [2019-10-15 01:23:19,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:19,200 INFO L462 AbstractCegarLoop]: Abstraction has 711 states and 964 transitions. [2019-10-15 01:23:19,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:19,200 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 964 transitions. [2019-10-15 01:23:19,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 01:23:19,203 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:19,203 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] [2019-10-15 01:23:19,203 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:19,204 INFO L82 PathProgramCache]: Analyzing trace with hash 2083769958, now seen corresponding path program 1 times [2019-10-15 01:23:19,204 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:19,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023739988] [2019-10-15 01:23:19,204 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,205 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:19,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:19,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:19,418 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:23:19,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023739988] [2019-10-15 01:23:19,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:19,419 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:19,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009627403] [2019-10-15 01:23:19,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:19,420 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:19,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:19,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:19,421 INFO L87 Difference]: Start difference. First operand 711 states and 964 transitions. Second operand 10 states. [2019-10-15 01:23:21,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:21,639 INFO L93 Difference]: Finished difference Result 2245 states and 3240 transitions. [2019-10-15 01:23:21,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:23:21,640 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-15 01:23:21,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:21,653 INFO L225 Difference]: With dead ends: 2245 [2019-10-15 01:23:21,654 INFO L226 Difference]: Without dead ends: 2114 [2019-10-15 01:23:21,656 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=366, Unknown=0, NotChecked=0, Total=552 [2019-10-15 01:23:21,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2114 states. [2019-10-15 01:23:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2114 to 722. [2019-10-15 01:23:21,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2019-10-15 01:23:21,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 978 transitions. [2019-10-15 01:23:21,723 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 978 transitions. Word has length 53 [2019-10-15 01:23:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:21,724 INFO L462 AbstractCegarLoop]: Abstraction has 722 states and 978 transitions. [2019-10-15 01:23:21,724 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:21,724 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 978 transitions. [2019-10-15 01:23:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:23:21,727 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:21,727 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] [2019-10-15 01:23:21,728 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:21,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:21,729 INFO L82 PathProgramCache]: Analyzing trace with hash -952135619, now seen corresponding path program 1 times [2019-10-15 01:23:21,729 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:21,729 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616138463] [2019-10-15 01:23:21,729 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,730 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:21,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:21,872 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:23:21,872 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616138463] [2019-10-15 01:23:21,872 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:21,873 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 01:23:21,873 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240732866] [2019-10-15 01:23:21,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 01:23:21,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:21,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 01:23:21,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 01:23:21,875 INFO L87 Difference]: Start difference. First operand 722 states and 978 transitions. Second operand 3 states. [2019-10-15 01:23:22,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:22,012 INFO L93 Difference]: Finished difference Result 1389 states and 1943 transitions. [2019-10-15 01:23:22,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 01:23:22,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-15 01:23:22,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:22,019 INFO L225 Difference]: With dead ends: 1389 [2019-10-15 01:23:22,020 INFO L226 Difference]: Without dead ends: 1060 [2019-10-15 01:23:22,021 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:23:22,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2019-10-15 01:23:22,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 1053. [2019-10-15 01:23:22,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-15 01:23:22,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-15 01:23:22,084 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-15 01:23:22,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:22,085 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-15 01:23:22,085 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 01:23:22,085 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-15 01:23:22,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:23:22,088 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:22,088 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] [2019-10-15 01:23:22,089 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:22,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:22,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1058176550, now seen corresponding path program 1 times [2019-10-15 01:23:22,089 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:22,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073186498] [2019-10-15 01:23:22,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,090 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:22,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:22,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:23:22,251 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073186498] [2019-10-15 01:23:22,252 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:22,252 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:22,252 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63455143] [2019-10-15 01:23:22,253 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:22,253 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:22,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:22,254 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 10 states. [2019-10-15 01:23:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:23,964 INFO L93 Difference]: Finished difference Result 2584 states and 3635 transitions. [2019-10-15 01:23:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:23:23,965 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-15 01:23:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:23,980 INFO L225 Difference]: With dead ends: 2584 [2019-10-15 01:23:23,981 INFO L226 Difference]: Without dead ends: 2367 [2019-10-15 01:23:23,983 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:23:23,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-10-15 01:23:24,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1053. [2019-10-15 01:23:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1053 states. [2019-10-15 01:23:24,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1053 states to 1053 states and 1444 transitions. [2019-10-15 01:23:24,062 INFO L78 Accepts]: Start accepts. Automaton has 1053 states and 1444 transitions. Word has length 54 [2019-10-15 01:23:24,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:24,064 INFO L462 AbstractCegarLoop]: Abstraction has 1053 states and 1444 transitions. [2019-10-15 01:23:24,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:24,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1053 states and 1444 transitions. [2019-10-15 01:23:24,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:23:24,067 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:24,067 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] [2019-10-15 01:23:24,067 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:24,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:24,068 INFO L82 PathProgramCache]: Analyzing trace with hash -609407585, now seen corresponding path program 1 times [2019-10-15 01:23:24,068 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:24,068 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529214077] [2019-10-15 01:23:24,068 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,069 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:24,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:24,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:24,346 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:23:24,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529214077] [2019-10-15 01:23:24,346 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:24,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:23:24,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024588353] [2019-10-15 01:23:24,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:23:24,348 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:24,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:23:24,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:23:24,349 INFO L87 Difference]: Start difference. First operand 1053 states and 1444 transitions. Second operand 12 states. [2019-10-15 01:23:25,044 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 33 DAG size of output: 31 [2019-10-15 01:23:28,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:28,005 INFO L93 Difference]: Finished difference Result 3802 states and 5406 transitions. [2019-10-15 01:23:28,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:28,006 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2019-10-15 01:23:28,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:28,023 INFO L225 Difference]: With dead ends: 3802 [2019-10-15 01:23:28,024 INFO L226 Difference]: Without dead ends: 3604 [2019-10-15 01:23:28,026 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=215, Invalid=541, Unknown=0, NotChecked=0, Total=756 [2019-10-15 01:23:28,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3604 states. [2019-10-15 01:23:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3604 to 1069. [2019-10-15 01:23:28,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2019-10-15 01:23:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1467 transitions. [2019-10-15 01:23:28,135 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1467 transitions. Word has length 54 [2019-10-15 01:23:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:28,136 INFO L462 AbstractCegarLoop]: Abstraction has 1069 states and 1467 transitions. [2019-10-15 01:23:28,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:23:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1467 transitions. [2019-10-15 01:23:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 01:23:28,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:28,139 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] [2019-10-15 01:23:28,139 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:28,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:28,140 INFO L82 PathProgramCache]: Analyzing trace with hash 963049592, now seen corresponding path program 1 times [2019-10-15 01:23:28,140 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:28,140 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656708454] [2019-10-15 01:23:28,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:28,141 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:28,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:28,276 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:23:28,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656708454] [2019-10-15 01:23:28,277 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:28,277 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:28,277 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188642005] [2019-10-15 01:23:28,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:28,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:28,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:28,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:28,279 INFO L87 Difference]: Start difference. First operand 1069 states and 1467 transitions. Second operand 9 states. [2019-10-15 01:23:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:29,679 INFO L93 Difference]: Finished difference Result 4058 states and 5764 transitions. [2019-10-15 01:23:29,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:29,680 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-15 01:23:29,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:29,695 INFO L225 Difference]: With dead ends: 4058 [2019-10-15 01:23:29,695 INFO L226 Difference]: Without dead ends: 3298 [2019-10-15 01:23:29,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:29,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3298 states. [2019-10-15 01:23:29,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3298 to 2389. [2019-10-15 01:23:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2389 states. [2019-10-15 01:23:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 3394 transitions. [2019-10-15 01:23:29,919 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 3394 transitions. Word has length 54 [2019-10-15 01:23:29,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:29,919 INFO L462 AbstractCegarLoop]: Abstraction has 2389 states and 3394 transitions. [2019-10-15 01:23:29,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:29,920 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 3394 transitions. [2019-10-15 01:23:29,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:29,923 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:29,923 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] [2019-10-15 01:23:29,923 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:29,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:29,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1344826450, now seen corresponding path program 1 times [2019-10-15 01:23:29,924 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:29,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375559437] [2019-10-15 01:23:29,924 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,925 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:29,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:30,061 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:23:30,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375559437] [2019-10-15 01:23:30,062 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:30,062 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:30,062 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489657105] [2019-10-15 01:23:30,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:30,064 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:30,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:30,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:30,065 INFO L87 Difference]: Start difference. First operand 2389 states and 3394 transitions. Second operand 7 states. [2019-10-15 01:23:31,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:31,487 INFO L93 Difference]: Finished difference Result 7376 states and 10821 transitions. [2019-10-15 01:23:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:31,493 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-15 01:23:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:31,516 INFO L225 Difference]: With dead ends: 7376 [2019-10-15 01:23:31,516 INFO L226 Difference]: Without dead ends: 6979 [2019-10-15 01:23:31,519 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-15 01:23:31,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-10-15 01:23:31,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 2390. [2019-10-15 01:23:31,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2390 states. [2019-10-15 01:23:31,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2390 states to 2390 states and 3396 transitions. [2019-10-15 01:23:31,813 INFO L78 Accepts]: Start accepts. Automaton has 2390 states and 3396 transitions. Word has length 55 [2019-10-15 01:23:31,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:31,814 INFO L462 AbstractCegarLoop]: Abstraction has 2390 states and 3396 transitions. [2019-10-15 01:23:31,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:23:31,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2390 states and 3396 transitions. [2019-10-15 01:23:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:31,818 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:31,818 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] [2019-10-15 01:23:31,818 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:31,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash 698198403, now seen corresponding path program 1 times [2019-10-15 01:23:31,819 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:31,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543214959] [2019-10-15 01:23:31,819 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,820 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:31,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:31,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:31,986 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:23:31,987 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543214959] [2019-10-15 01:23:31,989 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:31,989 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:31,989 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588050007] [2019-10-15 01:23:31,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:31,990 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:31,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:31,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:31,991 INFO L87 Difference]: Start difference. First operand 2390 states and 3396 transitions. Second operand 9 states. [2019-10-15 01:23:34,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:34,119 INFO L93 Difference]: Finished difference Result 6722 states and 9758 transitions. [2019-10-15 01:23:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-15 01:23:34,119 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:23:34,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:34,142 INFO L225 Difference]: With dead ends: 6722 [2019-10-15 01:23:34,143 INFO L226 Difference]: Without dead ends: 6171 [2019-10-15 01:23:34,146 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=183, Unknown=0, NotChecked=0, Total=272 [2019-10-15 01:23:34,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6171 states. [2019-10-15 01:23:34,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6171 to 2405. [2019-10-15 01:23:34,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2405 states. [2019-10-15 01:23:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2405 states to 2405 states and 3418 transitions. [2019-10-15 01:23:34,402 INFO L78 Accepts]: Start accepts. Automaton has 2405 states and 3418 transitions. Word has length 55 [2019-10-15 01:23:34,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:34,403 INFO L462 AbstractCegarLoop]: Abstraction has 2405 states and 3418 transitions. [2019-10-15 01:23:34,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:34,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2405 states and 3418 transitions. [2019-10-15 01:23:34,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:34,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:34,407 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] [2019-10-15 01:23:34,407 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:34,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:34,408 INFO L82 PathProgramCache]: Analyzing trace with hash 2110452651, now seen corresponding path program 1 times [2019-10-15 01:23:34,408 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:34,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052408174] [2019-10-15 01:23:34,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,408 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:34,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:34,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:34,496 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:23:34,497 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052408174] [2019-10-15 01:23:34,497 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:34,497 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:23:34,498 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51908566] [2019-10-15 01:23:34,498 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:23:34,498 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:34,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:23:34,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:23:34,499 INFO L87 Difference]: Start difference. First operand 2405 states and 3418 transitions. Second operand 6 states. [2019-10-15 01:23:35,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:35,074 INFO L93 Difference]: Finished difference Result 4138 states and 5959 transitions. [2019-10-15 01:23:35,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 01:23:35,075 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-15 01:23:35,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:35,081 INFO L225 Difference]: With dead ends: 4138 [2019-10-15 01:23:35,081 INFO L226 Difference]: Without dead ends: 2372 [2019-10-15 01:23:35,085 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:23:35,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2019-10-15 01:23:35,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 1715. [2019-10-15 01:23:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-15 01:23:35,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-15 01:23:35,305 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-15 01:23:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:35,305 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-15 01:23:35,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:23:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-15 01:23:35,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:35,308 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:35,308 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] [2019-10-15 01:23:35,308 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:35,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:35,309 INFO L82 PathProgramCache]: Analyzing trace with hash 1073379538, now seen corresponding path program 1 times [2019-10-15 01:23:35,309 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:35,309 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141792688] [2019-10-15 01:23:35,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,309 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:35,309 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:35,435 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:23:35,435 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141792688] [2019-10-15 01:23:35,435 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:35,435 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:23:35,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265260743] [2019-10-15 01:23:35,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:23:35,436 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:35,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:23:35,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:23:35,437 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 10 states. [2019-10-15 01:23:39,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:39,195 INFO L93 Difference]: Finished difference Result 8298 states and 11986 transitions. [2019-10-15 01:23:39,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-15 01:23:39,195 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 55 [2019-10-15 01:23:39,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:39,211 INFO L225 Difference]: With dead ends: 8298 [2019-10-15 01:23:39,211 INFO L226 Difference]: Without dead ends: 7766 [2019-10-15 01:23:39,214 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=272, Invalid=598, Unknown=0, NotChecked=0, Total=870 [2019-10-15 01:23:39,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7766 states. [2019-10-15 01:23:39,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7766 to 1715. [2019-10-15 01:23:39,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1715 states. [2019-10-15 01:23:39,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1715 states to 1715 states and 2419 transitions. [2019-10-15 01:23:39,517 INFO L78 Accepts]: Start accepts. Automaton has 1715 states and 2419 transitions. Word has length 55 [2019-10-15 01:23:39,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:39,517 INFO L462 AbstractCegarLoop]: Abstraction has 1715 states and 2419 transitions. [2019-10-15 01:23:39,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:23:39,518 INFO L276 IsEmpty]: Start isEmpty. Operand 1715 states and 2419 transitions. [2019-10-15 01:23:39,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:39,523 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:39,523 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] [2019-10-15 01:23:39,523 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:39,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:39,524 INFO L82 PathProgramCache]: Analyzing trace with hash -603462302, now seen corresponding path program 1 times [2019-10-15 01:23:39,524 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:39,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956380060] [2019-10-15 01:23:39,524 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,525 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:39,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:39,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:39,668 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:23:39,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956380060] [2019-10-15 01:23:39,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:39,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:39,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859613782] [2019-10-15 01:23:39,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:39,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:39,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:39,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:39,671 INFO L87 Difference]: Start difference. First operand 1715 states and 2419 transitions. Second operand 9 states. [2019-10-15 01:23:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:41,443 INFO L93 Difference]: Finished difference Result 7723 states and 11113 transitions. [2019-10-15 01:23:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:23:41,443 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:23:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:41,459 INFO L225 Difference]: With dead ends: 7723 [2019-10-15 01:23:41,459 INFO L226 Difference]: Without dead ends: 6251 [2019-10-15 01:23:41,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:23:41,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6251 states. [2019-10-15 01:23:42,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6251 to 4360. [2019-10-15 01:23:42,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4360 states. [2019-10-15 01:23:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4360 states to 4360 states and 6289 transitions. [2019-10-15 01:23:42,117 INFO L78 Accepts]: Start accepts. Automaton has 4360 states and 6289 transitions. Word has length 55 [2019-10-15 01:23:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:42,118 INFO L462 AbstractCegarLoop]: Abstraction has 4360 states and 6289 transitions. [2019-10-15 01:23:42,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand 4360 states and 6289 transitions. [2019-10-15 01:23:42,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 01:23:42,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:42,122 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] [2019-10-15 01:23:42,122 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:42,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:42,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1551481955, now seen corresponding path program 1 times [2019-10-15 01:23:42,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:42,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764544759] [2019-10-15 01:23:42,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:42,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:42,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:42,224 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:23:42,225 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764544759] [2019-10-15 01:23:42,225 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:42,225 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:23:42,225 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195049214] [2019-10-15 01:23:42,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:23:42,226 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:42,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:23:42,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:23:42,227 INFO L87 Difference]: Start difference. First operand 4360 states and 6289 transitions. Second operand 9 states. [2019-10-15 01:23:46,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:23:46,573 INFO L93 Difference]: Finished difference Result 15997 states and 22784 transitions. [2019-10-15 01:23:46,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-15 01:23:46,573 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 55 [2019-10-15 01:23:46,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:23:46,595 INFO L225 Difference]: With dead ends: 15997 [2019-10-15 01:23:46,596 INFO L226 Difference]: Without dead ends: 14521 [2019-10-15 01:23:46,602 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-15 01:23:46,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14521 states. [2019-10-15 01:23:47,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14521 to 4374. [2019-10-15 01:23:47,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4374 states. [2019-10-15 01:23:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 6307 transitions. [2019-10-15 01:23:47,365 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 6307 transitions. Word has length 55 [2019-10-15 01:23:47,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:23:47,365 INFO L462 AbstractCegarLoop]: Abstraction has 4374 states and 6307 transitions. [2019-10-15 01:23:47,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:23:47,365 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 6307 transitions. [2019-10-15 01:23:47,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 01:23:47,368 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:23:47,368 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] [2019-10-15 01:23:47,368 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:23:47,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:23:47,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1949047105, now seen corresponding path program 1 times [2019-10-15 01:23:47,369 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:23:47,369 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938023624] [2019-10-15 01:23:47,369 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,370 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:23:47,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:23:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:23:47,464 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:23:47,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938023624] [2019-10-15 01:23:47,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:23:47,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:23:47,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040322159] [2019-10-15 01:23:47,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:23:47,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:23:47,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:23:47,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:23:47,467 INFO L87 Difference]: Start difference. First operand 4374 states and 6307 transitions. Second operand 7 states.