java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:45,809 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:45,812 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:45,824 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:45,825 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:45,826 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:45,827 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:45,829 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:45,831 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:45,831 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:45,832 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:45,833 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:45,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:45,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:45,835 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:45,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:45,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:45,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:45,840 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:45,842 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:45,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:45,844 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:45,845 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:45,846 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:45,849 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:45,849 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:45,849 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:45,850 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:45,850 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:45,853 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:45,853 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:45,854 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:45,856 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:45,857 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:45,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:45,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:45,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:45,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:45,861 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:45,862 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:45,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:45,863 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:21:45,890 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:45,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:45,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:45,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:45,893 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:45,893 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:45,893 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:45,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:45,894 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:45,894 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:45,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:45,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:45,895 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:45,896 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:45,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:45,896 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:45,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:45,897 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:45,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:45,897 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:45,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:45,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:45,898 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:45,898 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:45,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:45,899 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:45,899 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:45,899 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:45,899 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:21:46,219 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:46,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:46,246 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:46,248 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:46,248 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:46,249 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-13 23:21:46,310 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59e3013/0d6e9e683de2457f8175af796ebd80a7/FLAGb460a4a25 [2019-10-13 23:21:46,864 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:46,864 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-13 23:21:46,884 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59e3013/0d6e9e683de2457f8175af796ebd80a7/FLAGb460a4a25 [2019-10-13 23:21:47,063 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f59e3013/0d6e9e683de2457f8175af796ebd80a7 [2019-10-13 23:21:47,072 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:47,073 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:47,074 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:47,074 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:47,078 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:47,079 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:47" (1/1) ... [2019-10-13 23:21:47,083 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@345a22c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:47, skipping insertion in model container [2019-10-13 23:21:47,083 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:47" (1/1) ... [2019-10-13 23:21:47,091 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:47,174 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:47,889 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:47,902 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:48,130 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:48,156 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:48,156 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48 WrapperNode [2019-10-13 23:21:48,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:48,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:48,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:48,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:48,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,205 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,206 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,265 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,301 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,308 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:48,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:48,328 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:48,328 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:48,329 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:48,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:48,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:48,429 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:48,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:48,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:21:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:48,431 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:48,432 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:48,433 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:48,435 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:48,436 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:50,711 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:50,711 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:50,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:50 BoogieIcfgContainer [2019-10-13 23:21:50,713 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:50,714 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:50,714 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:50,717 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:50,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:47" (1/3) ... [2019-10-13 23:21:50,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29404499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:50, skipping insertion in model container [2019-10-13 23:21:50,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (2/3) ... [2019-10-13 23:21:50,719 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29404499 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:50, skipping insertion in model container [2019-10-13 23:21:50,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:50" (3/3) ... [2019-10-13 23:21:50,720 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-13 23:21:50,730 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:50,741 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-13 23:21:50,752 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-13 23:21:50,791 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:50,791 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:50,792 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:50,792 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:50,792 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:50,792 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:50,793 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:50,793 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:50,842 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states. [2019-10-13 23:21:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:21:50,869 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:50,871 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] [2019-10-13 23:21:50,873 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:50,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:50,879 INFO L82 PathProgramCache]: Analyzing trace with hash -939220714, now seen corresponding path program 1 times [2019-10-13 23:21:50,892 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:50,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188874319] [2019-10-13 23:21:50,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188874319] [2019-10-13 23:21:51,357 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,357 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:51,358 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489523219] [2019-10-13 23:21:51,362 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:51,363 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:51,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:51,379 INFO L87 Difference]: Start difference. First operand 417 states. Second operand 3 states. [2019-10-13 23:21:51,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:51,525 INFO L93 Difference]: Finished difference Result 620 states and 1089 transitions. [2019-10-13 23:21:51,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:51,527 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-13 23:21:51,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:51,553 INFO L225 Difference]: With dead ends: 620 [2019-10-13 23:21:51,554 INFO L226 Difference]: Without dead ends: 491 [2019-10-13 23:21:51,560 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-13 23:21:51,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-10-13 23:21:51,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 485. [2019-10-13 23:21:51,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2019-10-13 23:21:51,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 624 transitions. [2019-10-13 23:21:51,653 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 624 transitions. Word has length 52 [2019-10-13 23:21:51,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,654 INFO L462 AbstractCegarLoop]: Abstraction has 485 states and 624 transitions. [2019-10-13 23:21:51,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:51,654 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 624 transitions. [2019-10-13 23:21:51,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:21:51,657 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,657 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] [2019-10-13 23:21:51,657 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,658 INFO L82 PathProgramCache]: Analyzing trace with hash 9345795, now seen corresponding path program 1 times [2019-10-13 23:21:51,658 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751350793] [2019-10-13 23:21:51,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,805 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751350793] [2019-10-13 23:21:51,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:51,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288784969] [2019-10-13 23:21:51,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:51,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:51,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:51,809 INFO L87 Difference]: Start difference. First operand 485 states and 624 transitions. Second operand 3 states. [2019-10-13 23:21:51,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:51,877 INFO L93 Difference]: Finished difference Result 786 states and 1042 transitions. [2019-10-13 23:21:51,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:51,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-10-13 23:21:51,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:51,881 INFO L225 Difference]: With dead ends: 786 [2019-10-13 23:21:51,881 INFO L226 Difference]: Without dead ends: 616 [2019-10-13 23:21:51,884 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-13 23:21:51,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 616 states. [2019-10-13 23:21:51,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 616 to 610. [2019-10-13 23:21:51,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2019-10-13 23:21:51,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 797 transitions. [2019-10-13 23:21:51,918 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 797 transitions. Word has length 52 [2019-10-13 23:21:51,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,919 INFO L462 AbstractCegarLoop]: Abstraction has 610 states and 797 transitions. [2019-10-13 23:21:51,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:51,919 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 797 transitions. [2019-10-13 23:21:51,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:21:51,921 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,921 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] [2019-10-13 23:21:51,922 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,922 INFO L82 PathProgramCache]: Analyzing trace with hash 1581802972, now seen corresponding path program 1 times [2019-10-13 23:21:51,922 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238056176] [2019-10-13 23:21:51,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:52,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:52,216 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238056176] [2019-10-13 23:21:52,217 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:52,217 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:52,218 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598076342] [2019-10-13 23:21:52,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:52,220 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:52,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:52,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:52,221 INFO L87 Difference]: Start difference. First operand 610 states and 797 transitions. Second operand 10 states. [2019-10-13 23:21:53,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:53,988 INFO L93 Difference]: Finished difference Result 1611 states and 2204 transitions. [2019-10-13 23:21:53,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-13 23:21:53,989 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 52 [2019-10-13 23:21:53,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:53,996 INFO L225 Difference]: With dead ends: 1611 [2019-10-13 23:21:53,996 INFO L226 Difference]: Without dead ends: 1521 [2019-10-13 23:21:53,998 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=299, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:21:54,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1521 states. [2019-10-13 23:21:54,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1521 to 621. [2019-10-13 23:21:54,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2019-10-13 23:21:54,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 811 transitions. [2019-10-13 23:21:54,040 INFO L78 Accepts]: Start accepts. Automaton has 621 states and 811 transitions. Word has length 52 [2019-10-13 23:21:54,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:54,040 INFO L462 AbstractCegarLoop]: Abstraction has 621 states and 811 transitions. [2019-10-13 23:21:54,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:54,041 INFO L276 IsEmpty]: Start isEmpty. Operand 621 states and 811 transitions. [2019-10-13 23:21:54,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:54,043 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:54,043 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-13 23:21:54,043 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:54,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:54,044 INFO L82 PathProgramCache]: Analyzing trace with hash 666756999, now seen corresponding path program 1 times [2019-10-13 23:21:54,044 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:54,044 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111222884] [2019-10-13 23:21:54,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,045 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,045 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,134 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:54,134 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111222884] [2019-10-13 23:21:54,135 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:54,135 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:54,135 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511567770] [2019-10-13 23:21:54,136 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:54,136 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:54,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:54,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:54,137 INFO L87 Difference]: Start difference. First operand 621 states and 811 transitions. Second operand 3 states. [2019-10-13 23:21:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:54,259 INFO L93 Difference]: Finished difference Result 1096 states and 1460 transitions. [2019-10-13 23:21:54,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:54,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-13 23:21:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:54,264 INFO L225 Difference]: With dead ends: 1096 [2019-10-13 23:21:54,264 INFO L226 Difference]: Without dead ends: 867 [2019-10-13 23:21:54,265 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-13 23:21:54,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-13 23:21:54,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 860. [2019-10-13 23:21:54,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-13 23:21:54,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-10-13 23:21:54,314 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-10-13 23:21:54,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:54,315 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-10-13 23:21:54,315 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:54,315 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-10-13 23:21:54,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:54,317 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:54,317 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-13 23:21:54,317 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:54,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:54,318 INFO L82 PathProgramCache]: Analyzing trace with hash 560716068, now seen corresponding path program 1 times [2019-10-13 23:21:54,318 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:54,318 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299148189] [2019-10-13 23:21:54,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,319 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:54,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:54,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299148189] [2019-10-13 23:21:54,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:54,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:54,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917676229] [2019-10-13 23:21:54,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:54,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:54,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:54,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:54,470 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 10 states. [2019-10-13 23:21:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:55,909 INFO L93 Difference]: Finished difference Result 1823 states and 2421 transitions. [2019-10-13 23:21:55,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 23:21:55,909 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 53 [2019-10-13 23:21:55,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:55,918 INFO L225 Difference]: With dead ends: 1823 [2019-10-13 23:21:55,918 INFO L226 Difference]: Without dead ends: 1684 [2019-10-13 23:21:55,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2019-10-13 23:21:55,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1684 states. [2019-10-13 23:21:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1684 to 860. [2019-10-13 23:21:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 860 states. [2019-10-13 23:21:55,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 860 states to 860 states and 1131 transitions. [2019-10-13 23:21:55,981 INFO L78 Accepts]: Start accepts. Automaton has 860 states and 1131 transitions. Word has length 53 [2019-10-13 23:21:55,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:55,981 INFO L462 AbstractCegarLoop]: Abstraction has 860 states and 1131 transitions. [2019-10-13 23:21:55,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:55,982 INFO L276 IsEmpty]: Start isEmpty. Operand 860 states and 1131 transitions. [2019-10-13 23:21:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:55,984 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:55,984 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-13 23:21:55,984 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:55,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1009485033, now seen corresponding path program 1 times [2019-10-13 23:21:55,985 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:55,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354181122] [2019-10-13 23:21:55,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:55,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:55,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:56,167 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354181122] [2019-10-13 23:21:56,167 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:56,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:56,168 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621744847] [2019-10-13 23:21:56,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:56,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:56,169 INFO L87 Difference]: Start difference. First operand 860 states and 1131 transitions. Second operand 12 states. [2019-10-13 23:21:59,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:59,052 INFO L93 Difference]: Finished difference Result 2593 states and 3482 transitions. [2019-10-13 23:21:59,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-13 23:21:59,052 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2019-10-13 23:21:59,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:59,064 INFO L225 Difference]: With dead ends: 2593 [2019-10-13 23:21:59,064 INFO L226 Difference]: Without dead ends: 2471 [2019-10-13 23:21:59,065 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=190, Invalid=460, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:21:59,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2471 states. [2019-10-13 23:21:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2471 to 876. [2019-10-13 23:21:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 876 states. [2019-10-13 23:21:59,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1154 transitions. [2019-10-13 23:21:59,149 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1154 transitions. Word has length 53 [2019-10-13 23:21:59,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:59,149 INFO L462 AbstractCegarLoop]: Abstraction has 876 states and 1154 transitions. [2019-10-13 23:21:59,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1154 transitions. [2019-10-13 23:21:59,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-13 23:21:59,151 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:59,152 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-13 23:21:59,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:59,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:59,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1713025086, now seen corresponding path program 1 times [2019-10-13 23:21:59,153 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:59,153 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858120486] [2019-10-13 23:21:59,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,153 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:59,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:59,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:59,290 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858120486] [2019-10-13 23:21:59,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:59,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:21:59,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522891600] [2019-10-13 23:21:59,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:21:59,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:59,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:21:59,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:21:59,292 INFO L87 Difference]: Start difference. First operand 876 states and 1154 transitions. Second operand 9 states. [2019-10-13 23:22:00,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:00,444 INFO L93 Difference]: Finished difference Result 3059 states and 4131 transitions. [2019-10-13 23:22:00,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:00,445 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2019-10-13 23:22:00,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:00,457 INFO L225 Difference]: With dead ends: 3059 [2019-10-13 23:22:00,457 INFO L226 Difference]: Without dead ends: 2491 [2019-10-13 23:22:00,459 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-13 23:22:00,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2491 states. [2019-10-13 23:22:00,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2491 to 1818. [2019-10-13 23:22:00,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1818 states. [2019-10-13 23:22:00,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1818 states to 1818 states and 2449 transitions. [2019-10-13 23:22:00,692 INFO L78 Accepts]: Start accepts. Automaton has 1818 states and 2449 transitions. Word has length 53 [2019-10-13 23:22:00,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:00,692 INFO L462 AbstractCegarLoop]: Abstraction has 1818 states and 2449 transitions. [2019-10-13 23:22:00,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:00,692 INFO L276 IsEmpty]: Start isEmpty. Operand 1818 states and 2449 transitions. [2019-10-13 23:22:00,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:00,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:00,696 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-13 23:22:00,696 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:00,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:00,697 INFO L82 PathProgramCache]: Analyzing trace with hash -9109944, now seen corresponding path program 1 times [2019-10-13 23:22:00,697 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:00,697 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194830937] [2019-10-13 23:22:00,697 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,698 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:00,698 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:00,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:00,790 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194830937] [2019-10-13 23:22:00,790 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:00,791 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:00,791 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102848198] [2019-10-13 23:22:00,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:00,792 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:00,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:00,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:00,793 INFO L87 Difference]: Start difference. First operand 1818 states and 2449 transitions. Second operand 7 states. [2019-10-13 23:22:02,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:02,234 INFO L93 Difference]: Finished difference Result 4552 states and 6282 transitions. [2019-10-13 23:22:02,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:02,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-10-13 23:22:02,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:02,258 INFO L225 Difference]: With dead ends: 4552 [2019-10-13 23:22:02,259 INFO L226 Difference]: Without dead ends: 4309 [2019-10-13 23:22:02,263 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-13 23:22:02,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4309 states. [2019-10-13 23:22:02,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4309 to 1819. [2019-10-13 23:22:02,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-10-13 23:22:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 2451 transitions. [2019-10-13 23:22:02,529 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 2451 transitions. Word has length 54 [2019-10-13 23:22:02,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:02,529 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 2451 transitions. [2019-10-13 23:22:02,530 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:02,530 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 2451 transitions. [2019-10-13 23:22:02,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:02,532 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:02,533 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-13 23:22:02,533 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:02,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:02,533 INFO L82 PathProgramCache]: Analyzing trace with hash -655737991, now seen corresponding path program 1 times [2019-10-13 23:22:02,534 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:02,534 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053145137] [2019-10-13 23:22:02,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,534 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:02,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:02,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:02,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:02,725 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053145137] [2019-10-13 23:22:02,726 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:02,727 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:02,728 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383539193] [2019-10-13 23:22:02,728 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:02,728 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:02,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:02,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:02,729 INFO L87 Difference]: Start difference. First operand 1819 states and 2451 transitions. Second operand 9 states. [2019-10-13 23:22:04,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:04,129 INFO L93 Difference]: Finished difference Result 4073 states and 5514 transitions. [2019-10-13 23:22:04,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-13 23:22:04,130 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 23:22:04,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:04,146 INFO L225 Difference]: With dead ends: 4073 [2019-10-13 23:22:04,146 INFO L226 Difference]: Without dead ends: 3737 [2019-10-13 23:22:04,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:22:04,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3737 states. [2019-10-13 23:22:04,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3737 to 1834. [2019-10-13 23:22:04,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1834 states. [2019-10-13 23:22:04,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1834 states to 1834 states and 2473 transitions. [2019-10-13 23:22:04,385 INFO L78 Accepts]: Start accepts. Automaton has 1834 states and 2473 transitions. Word has length 54 [2019-10-13 23:22:04,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:04,385 INFO L462 AbstractCegarLoop]: Abstraction has 1834 states and 2473 transitions. [2019-10-13 23:22:04,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:04,386 INFO L276 IsEmpty]: Start isEmpty. Operand 1834 states and 2473 transitions. [2019-10-13 23:22:04,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:04,391 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:04,391 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-13 23:22:04,391 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:04,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:04,394 INFO L82 PathProgramCache]: Analyzing trace with hash 756516257, now seen corresponding path program 1 times [2019-10-13 23:22:04,394 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:04,395 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122555529] [2019-10-13 23:22:04,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,395 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:04,395 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:04,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:04,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:04,514 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122555529] [2019-10-13 23:22:04,514 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:04,514 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:04,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725958019] [2019-10-13 23:22:04,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:04,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:04,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:04,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:04,516 INFO L87 Difference]: Start difference. First operand 1834 states and 2473 transitions. Second operand 6 states. [2019-10-13 23:22:05,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:05,017 INFO L93 Difference]: Finished difference Result 2951 states and 4007 transitions. [2019-10-13 23:22:05,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:05,017 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-13 23:22:05,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:05,024 INFO L225 Difference]: With dead ends: 2951 [2019-10-13 23:22:05,024 INFO L226 Difference]: Without dead ends: 1707 [2019-10-13 23:22:05,026 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-13 23:22:05,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-10-13 23:22:05,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1270. [2019-10-13 23:22:05,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-10-13 23:22:05,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-10-13 23:22:05,168 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-10-13 23:22:05,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:05,169 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-10-13 23:22:05,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:05,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-10-13 23:22:05,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:05,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:05,171 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-13 23:22:05,171 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:05,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:05,172 INFO L82 PathProgramCache]: Analyzing trace with hash -280556856, now seen corresponding path program 1 times [2019-10-13 23:22:05,172 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:05,172 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163743618] [2019-10-13 23:22:05,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,172 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:05,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:05,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:05,293 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163743618] [2019-10-13 23:22:05,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:05,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:22:05,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034735949] [2019-10-13 23:22:05,294 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:22:05,294 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:05,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:22:05,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:22:05,295 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 10 states. [2019-10-13 23:22:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:08,206 INFO L93 Difference]: Finished difference Result 5723 states and 7880 transitions. [2019-10-13 23:22:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-13 23:22:08,207 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 54 [2019-10-13 23:22:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:08,222 INFO L225 Difference]: With dead ends: 5723 [2019-10-13 23:22:08,223 INFO L226 Difference]: Without dead ends: 5403 [2019-10-13 23:22:08,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2019-10-13 23:22:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5403 states. [2019-10-13 23:22:08,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5403 to 1270. [2019-10-13 23:22:08,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1270 states. [2019-10-13 23:22:08,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1270 states to 1270 states and 1694 transitions. [2019-10-13 23:22:08,407 INFO L78 Accepts]: Start accepts. Automaton has 1270 states and 1694 transitions. Word has length 54 [2019-10-13 23:22:08,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:08,408 INFO L462 AbstractCegarLoop]: Abstraction has 1270 states and 1694 transitions. [2019-10-13 23:22:08,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:22:08,408 INFO L276 IsEmpty]: Start isEmpty. Operand 1270 states and 1694 transitions. [2019-10-13 23:22:08,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:08,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:08,410 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-13 23:22:08,411 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:08,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:08,411 INFO L82 PathProgramCache]: Analyzing trace with hash -1957398696, now seen corresponding path program 1 times [2019-10-13 23:22:08,411 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:08,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113956049] [2019-10-13 23:22:08,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:08,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:08,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-13 23:22:08,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113956049] [2019-10-13 23:22:08,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:08,515 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:08,515 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748274302] [2019-10-13 23:22:08,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:08,516 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:08,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:08,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:08,520 INFO L87 Difference]: Start difference. First operand 1270 states and 1694 transitions. Second operand 9 states. [2019-10-13 23:22:10,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:10,061 INFO L93 Difference]: Finished difference Result 5418 states and 7321 transitions. [2019-10-13 23:22:10,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 23:22:10,062 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 23:22:10,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:10,079 INFO L225 Difference]: With dead ends: 5418 [2019-10-13 23:22:10,079 INFO L226 Difference]: Without dead ends: 4390 [2019-10-13 23:22:10,082 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-13 23:22:10,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4390 states. [2019-10-13 23:22:10,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4390 to 3039. [2019-10-13 23:22:10,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3039 states. [2019-10-13 23:22:10,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 4094 transitions. [2019-10-13 23:22:10,539 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 4094 transitions. Word has length 54 [2019-10-13 23:22:10,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:10,539 INFO L462 AbstractCegarLoop]: Abstraction has 3039 states and 4094 transitions. [2019-10-13 23:22:10,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:10,540 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 4094 transitions. [2019-10-13 23:22:10,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-13 23:22:10,544 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:10,544 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-13 23:22:10,544 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:10,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:10,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1389548947, now seen corresponding path program 1 times [2019-10-13 23:22:10,545 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:10,545 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508598244] [2019-10-13 23:22:10,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,545 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:10,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:10,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:10,635 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508598244] [2019-10-13 23:22:10,635 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:10,635 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 23:22:10,635 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783142437] [2019-10-13 23:22:10,635 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 23:22:10,636 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:10,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 23:22:10,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 23:22:10,637 INFO L87 Difference]: Start difference. First operand 3039 states and 4094 transitions. Second operand 9 states. [2019-10-13 23:22:14,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:14,593 INFO L93 Difference]: Finished difference Result 11909 states and 16000 transitions. [2019-10-13 23:22:14,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-13 23:22:14,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2019-10-13 23:22:14,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:14,615 INFO L225 Difference]: With dead ends: 11909 [2019-10-13 23:22:14,616 INFO L226 Difference]: Without dead ends: 10979 [2019-10-13 23:22:14,620 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=191, Invalid=409, Unknown=0, NotChecked=0, Total=600 [2019-10-13 23:22:14,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10979 states. [2019-10-13 23:22:15,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10979 to 3053. [2019-10-13 23:22:15,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-10-13 23:22:15,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-10-13 23:22:15,263 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 54 [2019-10-13 23:22:15,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:15,263 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-10-13 23:22:15,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 23:22:15,264 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-10-13 23:22:15,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:15,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:15,269 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-13 23:22:15,269 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:15,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:15,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1368275445, now seen corresponding path program 1 times [2019-10-13 23:22:15,270 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:15,270 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477671757] [2019-10-13 23:22:15,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:15,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477671757] [2019-10-13 23:22:15,396 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:15,396 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:15,396 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875889789] [2019-10-13 23:22:15,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:15,397 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:15,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:15,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:15,397 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 7 states. [2019-10-13 23:22:18,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:18,109 INFO L93 Difference]: Finished difference Result 9397 states and 12860 transitions. [2019-10-13 23:22:18,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:18,109 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-13 23:22:18,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:18,126 INFO L225 Difference]: With dead ends: 9397 [2019-10-13 23:22:18,126 INFO L226 Difference]: Without dead ends: 8587 [2019-10-13 23:22:18,130 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-13 23:22:18,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8587 states. [2019-10-13 23:22:18,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8587 to 3053. [2019-10-13 23:22:18,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-10-13 23:22:18,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4112 transitions. [2019-10-13 23:22:18,801 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4112 transitions. Word has length 55 [2019-10-13 23:22:18,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:18,801 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4112 transitions. [2019-10-13 23:22:18,802 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:18,802 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4112 transitions. [2019-10-13 23:22:18,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:18,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:18,806 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-13 23:22:18,807 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:18,807 INFO L82 PathProgramCache]: Analyzing trace with hash 700602732, now seen corresponding path program 1 times [2019-10-13 23:22:18,807 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:18,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765089419] [2019-10-13 23:22:18,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:18,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:18,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:18,880 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765089419] [2019-10-13 23:22:18,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:18,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:22:18,881 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353297043] [2019-10-13 23:22:18,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:22:18,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:22:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:22:18,882 INFO L87 Difference]: Start difference. First operand 3053 states and 4112 transitions. Second operand 6 states. [2019-10-13 23:22:19,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:19,840 INFO L93 Difference]: Finished difference Result 5337 states and 7221 transitions. [2019-10-13 23:22:19,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:22:19,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-10-13 23:22:19,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:19,846 INFO L225 Difference]: With dead ends: 5337 [2019-10-13 23:22:19,847 INFO L226 Difference]: Without dead ends: 3006 [2019-10-13 23:22:19,851 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-13 23:22:19,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3006 states. [2019-10-13 23:22:20,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3006 to 2141. [2019-10-13 23:22:20,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-10-13 23:22:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2840 transitions. [2019-10-13 23:22:20,368 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2840 transitions. Word has length 55 [2019-10-13 23:22:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:20,368 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 2840 transitions. [2019-10-13 23:22:20,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:22:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2840 transitions. [2019-10-13 23:22:20,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:20,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:20,371 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-13 23:22:20,371 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:20,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:20,372 INFO L82 PathProgramCache]: Analyzing trace with hash -208773994, now seen corresponding path program 1 times [2019-10-13 23:22:20,372 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:20,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112488405] [2019-10-13 23:22:20,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:20,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:20,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:20,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112488405] [2019-10-13 23:22:20,460 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:20,460 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:20,460 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434603641] [2019-10-13 23:22:20,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:20,461 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:20,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:20,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:20,462 INFO L87 Difference]: Start difference. First operand 2141 states and 2840 transitions. Second operand 7 states. [2019-10-13 23:22:22,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:22,570 INFO L93 Difference]: Finished difference Result 6789 states and 9152 transitions. [2019-10-13 23:22:22,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:22,570 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-10-13 23:22:22,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:22,578 INFO L225 Difference]: With dead ends: 6789 [2019-10-13 23:22:22,578 INFO L226 Difference]: Without dead ends: 5894 [2019-10-13 23:22:22,581 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=136, Unknown=0, NotChecked=0, Total=210 [2019-10-13 23:22:22,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5894 states. [2019-10-13 23:22:23,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5894 to 2141. [2019-10-13 23:22:23,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2141 states. [2019-10-13 23:22:23,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2141 states to 2141 states and 2840 transitions. [2019-10-13 23:22:23,292 INFO L78 Accepts]: Start accepts. Automaton has 2141 states and 2840 transitions. Word has length 55 [2019-10-13 23:22:23,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:23,293 INFO L462 AbstractCegarLoop]: Abstraction has 2141 states and 2840 transitions. [2019-10-13 23:22:23,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:23,293 INFO L276 IsEmpty]: Start isEmpty. Operand 2141 states and 2840 transitions. [2019-10-13 23:22:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:23,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:23,294 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-13 23:22:23,295 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:23,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:23,295 INFO L82 PathProgramCache]: Analyzing trace with hash 76050926, now seen corresponding path program 1 times [2019-10-13 23:22:23,295 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:23,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302383654] [2019-10-13 23:22:23,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:23,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:23,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:23,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:23,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302383654] [2019-10-13 23:22:23,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:23,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:22:23,357 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607733163] [2019-10-13 23:22:23,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:22:23,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:23,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:22:23,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:22:23,358 INFO L87 Difference]: Start difference. First operand 2141 states and 2840 transitions. Second operand 5 states.