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_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:45,778 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:45,780 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:45,792 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:45,793 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:45,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:45,795 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:45,797 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:45,798 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:45,799 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:45,800 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:45,801 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:45,802 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:45,803 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:45,804 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:45,805 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:45,806 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:45,807 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:45,809 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:45,811 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:45,812 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:45,814 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:45,815 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:45,816 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:45,818 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:45,818 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:45,819 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:45,820 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:45,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:45,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:45,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:45,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:45,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:45,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:45,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:45,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:45,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:45,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:45,826 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:45,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:45,828 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:45,829 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:26:45,844 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:45,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:45,847 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:45,847 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:45,847 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:45,848 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:45,848 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:45,848 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:45,848 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:45,848 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:45,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:45,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:45,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:45,849 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:45,849 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:45,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:45,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:45,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:45,850 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:45,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:45,851 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:45,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:45,852 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:45,852 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:45,852 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:45,852 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:45,853 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:45,853 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:45,853 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-15 03:26:46,175 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:26:46,187 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:26:46,191 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:26:46,192 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:26:46,193 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:26:46,193 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 03:26:46,272 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47c2aad0/6c247e7b660746919b3cee5be17c5ade/FLAGdaa09562f [2019-10-15 03:26:46,795 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:26:46,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 03:26:46,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47c2aad0/6c247e7b660746919b3cee5be17c5ade/FLAGdaa09562f [2019-10-15 03:26:47,091 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f47c2aad0/6c247e7b660746919b3cee5be17c5ade [2019-10-15 03:26:47,103 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:26:47,105 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:26:47,106 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:47,106 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:26:47,110 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:26:47,111 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1118f63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47, skipping insertion in model container [2019-10-15 03:26:47,114 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,122 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:26:47,175 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:26:47,516 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:47,623 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:26:47,706 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:26:47,740 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:26:47,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47 WrapperNode [2019-10-15 03:26:47,741 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:26:47,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:26:47,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:26:47,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:26:47,753 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,753 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,765 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,765 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,783 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,794 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... [2019-10-15 03:26:47,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:26:47,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:26:47,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:26:47,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:26:47,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:47,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:26:47,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:26:47,857 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:26:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:26:47,857 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:26:47,858 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:26:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:26:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:26:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:26:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:26:47,859 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:26:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:26:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:26:47,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:26:49,358 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:26:49,358 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:26:49,360 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:49 BoogieIcfgContainer [2019-10-15 03:26:49,360 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:26:49,362 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:26:49,362 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:26:49,366 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:26:49,366 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:26:47" (1/3) ... [2019-10-15 03:26:49,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60855f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:49, skipping insertion in model container [2019-10-15 03:26:49,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:26:47" (2/3) ... [2019-10-15 03:26:49,368 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60855f2a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:26:49, skipping insertion in model container [2019-10-15 03:26:49,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:26:49" (3/3) ... [2019-10-15 03:26:49,371 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.UNBOUNDED.pals.c.v+cfa-reducer.c [2019-10-15 03:26:49,382 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:26:49,392 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:26:49,406 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:26:49,439 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:26:49,439 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:26:49,440 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:26:49,440 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:26:49,440 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:26:49,441 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:26:49,441 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:26:49,441 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:26:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states. [2019-10-15 03:26:49,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-15 03:26:49,474 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:49,475 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] [2019-10-15 03:26:49,477 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:49,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:49,485 INFO L82 PathProgramCache]: Analyzing trace with hash 2138769479, now seen corresponding path program 1 times [2019-10-15 03:26:49,497 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:49,497 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803771553] [2019-10-15 03:26:49,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,498 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:49,498 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:49,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:50,015 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803771553] [2019-10-15 03:26:50,016 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:50,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734344880] [2019-10-15 03:26:50,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:50,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:50,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,040 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 3 states. [2019-10-15 03:26:50,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,137 INFO L93 Difference]: Finished difference Result 220 states and 356 transitions. [2019-10-15 03:26:50,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:50,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-15 03:26:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,159 INFO L225 Difference]: With dead ends: 220 [2019-10-15 03:26:50,159 INFO L226 Difference]: Without dead ends: 144 [2019-10-15 03:26:50,166 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-10-15 03:26:50,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 142. [2019-10-15 03:26:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2019-10-15 03:26:50,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 213 transitions. [2019-10-15 03:26:50,254 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 213 transitions. Word has length 41 [2019-10-15 03:26:50,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:50,256 INFO L462 AbstractCegarLoop]: Abstraction has 142 states and 213 transitions. [2019-10-15 03:26:50,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:50,257 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 213 transitions. [2019-10-15 03:26:50,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-15 03:26:50,260 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:50,260 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] [2019-10-15 03:26:50,260 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:50,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:50,261 INFO L82 PathProgramCache]: Analyzing trace with hash 2105877559, now seen corresponding path program 1 times [2019-10-15 03:26:50,262 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:50,262 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829730792] [2019-10-15 03:26:50,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,262 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:50,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,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-15 03:26:50,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829730792] [2019-10-15 03:26:50,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:50,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807298801] [2019-10-15 03:26:50,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:50,471 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:50,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,472 INFO L87 Difference]: Start difference. First operand 142 states and 213 transitions. Second operand 3 states. [2019-10-15 03:26:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,568 INFO L93 Difference]: Finished difference Result 319 states and 500 transitions. [2019-10-15 03:26:50,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:50,569 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-10-15 03:26:50,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,571 INFO L225 Difference]: With dead ends: 319 [2019-10-15 03:26:50,572 INFO L226 Difference]: Without dead ends: 207 [2019-10-15 03:26:50,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2019-10-15 03:26:50,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2019-10-15 03:26:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2019-10-15 03:26:50,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 312 transitions. [2019-10-15 03:26:50,612 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 312 transitions. Word has length 43 [2019-10-15 03:26:50,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:50,613 INFO L462 AbstractCegarLoop]: Abstraction has 205 states and 312 transitions. [2019-10-15 03:26:50,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:50,614 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 312 transitions. [2019-10-15 03:26:50,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-15 03:26:50,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:50,621 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] [2019-10-15 03:26:50,657 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:50,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:50,658 INFO L82 PathProgramCache]: Analyzing trace with hash -486820712, now seen corresponding path program 1 times [2019-10-15 03:26:50,658 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:50,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792851220] [2019-10-15 03:26:50,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,659 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,659 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:50,775 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792851220] [2019-10-15 03:26:50,776 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,776 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:50,777 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930781494] [2019-10-15 03:26:50,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:50,779 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:50,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,780 INFO L87 Difference]: Start difference. First operand 205 states and 312 transitions. Second operand 3 states. [2019-10-15 03:26:50,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:50,833 INFO L93 Difference]: Finished difference Result 509 states and 803 transitions. [2019-10-15 03:26:50,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:50,834 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 45 [2019-10-15 03:26:50,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:50,838 INFO L225 Difference]: With dead ends: 509 [2019-10-15 03:26:50,838 INFO L226 Difference]: Without dead ends: 336 [2019-10-15 03:26:50,843 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2019-10-15 03:26:50,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 334. [2019-10-15 03:26:50,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2019-10-15 03:26:50,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 519 transitions. [2019-10-15 03:26:50,888 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 519 transitions. Word has length 45 [2019-10-15 03:26:50,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:50,888 INFO L462 AbstractCegarLoop]: Abstraction has 334 states and 519 transitions. [2019-10-15 03:26:50,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:50,889 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 519 transitions. [2019-10-15 03:26:50,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-15 03:26:50,893 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:50,893 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] [2019-10-15 03:26:50,893 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:50,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:50,894 INFO L82 PathProgramCache]: Analyzing trace with hash 219909761, now seen corresponding path program 1 times [2019-10-15 03:26:50,895 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:50,895 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107071591] [2019-10-15 03:26:50,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,895 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:50,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:50,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:50,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:50,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107071591] [2019-10-15 03:26:50,995 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:50,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:50,996 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560333835] [2019-10-15 03:26:50,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:50,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:50,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:50,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:50,997 INFO L87 Difference]: Start difference. First operand 334 states and 519 transitions. Second operand 3 states. [2019-10-15 03:26:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:51,036 INFO L93 Difference]: Finished difference Result 825 states and 1310 transitions. [2019-10-15 03:26:51,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:51,037 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-15 03:26:51,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:51,040 INFO L225 Difference]: With dead ends: 825 [2019-10-15 03:26:51,040 INFO L226 Difference]: Without dead ends: 523 [2019-10-15 03:26:51,042 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-10-15 03:26:51,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 521. [2019-10-15 03:26:51,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2019-10-15 03:26:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 819 transitions. [2019-10-15 03:26:51,067 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 819 transitions. Word has length 47 [2019-10-15 03:26:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,067 INFO L462 AbstractCegarLoop]: Abstraction has 521 states and 819 transitions. [2019-10-15 03:26:51,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 819 transitions. [2019-10-15 03:26:51,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-15 03:26:51,068 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,069 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] [2019-10-15 03:26:51,069 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,069 INFO L82 PathProgramCache]: Analyzing trace with hash -82051422, now seen corresponding path program 1 times [2019-10-15 03:26:51,070 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,070 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354642195] [2019-10-15 03:26:51,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,070 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:51,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354642195] [2019-10-15 03:26:51,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,131 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:51,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665866130] [2019-10-15 03:26:51,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:51,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:51,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,133 INFO L87 Difference]: Start difference. First operand 521 states and 819 transitions. Second operand 3 states. [2019-10-15 03:26:51,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:51,189 INFO L93 Difference]: Finished difference Result 1341 states and 2138 transitions. [2019-10-15 03:26:51,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:51,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-15 03:26:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:51,195 INFO L225 Difference]: With dead ends: 1341 [2019-10-15 03:26:51,195 INFO L226 Difference]: Without dead ends: 868 [2019-10-15 03:26:51,197 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 868 states. [2019-10-15 03:26:51,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 868 to 866. [2019-10-15 03:26:51,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 866 states. [2019-10-15 03:26:51,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 866 states to 866 states and 1365 transitions. [2019-10-15 03:26:51,238 INFO L78 Accepts]: Start accepts. Automaton has 866 states and 1365 transitions. Word has length 49 [2019-10-15 03:26:51,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,239 INFO L462 AbstractCegarLoop]: Abstraction has 866 states and 1365 transitions. [2019-10-15 03:26:51,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:51,239 INFO L276 IsEmpty]: Start isEmpty. Operand 866 states and 1365 transitions. [2019-10-15 03:26:51,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-15 03:26:51,240 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,240 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] [2019-10-15 03:26:51,240 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,241 INFO L82 PathProgramCache]: Analyzing trace with hash -2105773738, now seen corresponding path program 1 times [2019-10-15 03:26:51,241 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744440129] [2019-10-15 03:26:51,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:51,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744440129] [2019-10-15 03:26:51,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,309 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:26:51,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814501456] [2019-10-15 03:26:51,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:26:51,310 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:26:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,310 INFO L87 Difference]: Start difference. First operand 866 states and 1365 transitions. Second operand 3 states. [2019-10-15 03:26:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:51,402 INFO L93 Difference]: Finished difference Result 2173 states and 3461 transitions. [2019-10-15 03:26:51,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:26:51,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-15 03:26:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:51,411 INFO L225 Difference]: With dead ends: 2173 [2019-10-15 03:26:51,411 INFO L226 Difference]: Without dead ends: 1355 [2019-10-15 03:26:51,413 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:26:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1355 states. [2019-10-15 03:26:51,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1355 to 1353. [2019-10-15 03:26:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1353 states. [2019-10-15 03:26:51,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 2142 transitions. [2019-10-15 03:26:51,480 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 2142 transitions. Word has length 51 [2019-10-15 03:26:51,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:51,481 INFO L462 AbstractCegarLoop]: Abstraction has 1353 states and 2142 transitions. [2019-10-15 03:26:51,481 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:26:51,481 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 2142 transitions. [2019-10-15 03:26:51,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-15 03:26:51,482 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:51,482 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:51,482 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:51,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:51,483 INFO L82 PathProgramCache]: Analyzing trace with hash -1506952457, now seen corresponding path program 1 times [2019-10-15 03:26:51,483 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:51,483 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367305214] [2019-10-15 03:26:51,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,483 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:51,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:51,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:51,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:51,612 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367305214] [2019-10-15 03:26:51,612 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:51,612 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:51,613 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928751581] [2019-10-15 03:26:51,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:51,613 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:51,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:51,614 INFO L87 Difference]: Start difference. First operand 1353 states and 2142 transitions. Second operand 5 states. [2019-10-15 03:26:51,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:51,934 INFO L93 Difference]: Finished difference Result 3441 states and 5469 transitions. [2019-10-15 03:26:51,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 03:26:51,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 53 [2019-10-15 03:26:51,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:51,946 INFO L225 Difference]: With dead ends: 3441 [2019-10-15 03:26:51,946 INFO L226 Difference]: Without dead ends: 2152 [2019-10-15 03:26:51,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:26:51,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2152 states. [2019-10-15 03:26:52,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2152 to 2142. [2019-10-15 03:26:52,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-10-15 03:26:52,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 3376 transitions. [2019-10-15 03:26:52,108 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 3376 transitions. Word has length 53 [2019-10-15 03:26:52,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:52,108 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 3376 transitions. [2019-10-15 03:26:52,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 3376 transitions. [2019-10-15 03:26:52,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-15 03:26:52,109 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:52,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:52,109 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:52,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:52,110 INFO L82 PathProgramCache]: Analyzing trace with hash 467503626, now seen corresponding path program 1 times [2019-10-15 03:26:52,110 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:52,110 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264880228] [2019-10-15 03:26:52,110 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,111 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,111 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:52,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:52,198 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264880228] [2019-10-15 03:26:52,198 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:52,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:26:52,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232563044] [2019-10-15 03:26:52,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:26:52,199 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:26:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:52,200 INFO L87 Difference]: Start difference. First operand 2142 states and 3376 transitions. Second operand 6 states. [2019-10-15 03:26:52,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:52,735 INFO L93 Difference]: Finished difference Result 5867 states and 9260 transitions. [2019-10-15 03:26:52,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-15 03:26:52,735 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-10-15 03:26:52,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:52,756 INFO L225 Difference]: With dead ends: 5867 [2019-10-15 03:26:52,756 INFO L226 Difference]: Without dead ends: 3789 [2019-10-15 03:26:52,765 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-10-15 03:26:52,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3789 states. [2019-10-15 03:26:52,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3789 to 2571. [2019-10-15 03:26:52,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-15 03:26:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4020 transitions. [2019-10-15 03:26:52,973 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4020 transitions. Word has length 54 [2019-10-15 03:26:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:52,973 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4020 transitions. [2019-10-15 03:26:52,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:26:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4020 transitions. [2019-10-15 03:26:52,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-15 03:26:52,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:52,974 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:52,975 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:52,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:52,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1550658078, now seen corresponding path program 1 times [2019-10-15 03:26:52,975 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:52,976 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231642306] [2019-10-15 03:26:52,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,976 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:52,976 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:53,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:53,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:53,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231642306] [2019-10-15 03:26:53,067 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:53,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:26:53,068 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486025522] [2019-10-15 03:26:53,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:26:53,069 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:53,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:26:53,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:26:53,069 INFO L87 Difference]: Start difference. First operand 2571 states and 4020 transitions. Second operand 4 states. [2019-10-15 03:26:53,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:53,280 INFO L93 Difference]: Finished difference Result 5080 states and 7961 transitions. [2019-10-15 03:26:53,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:26:53,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-10-15 03:26:53,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:53,294 INFO L225 Difference]: With dead ends: 5080 [2019-10-15 03:26:53,295 INFO L226 Difference]: Without dead ends: 2573 [2019-10-15 03:26:53,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:53,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-15 03:26:53,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-15 03:26:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-15 03:26:53,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 4008 transitions. [2019-10-15 03:26:53,488 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 4008 transitions. Word has length 55 [2019-10-15 03:26:53,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:53,489 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 4008 transitions. [2019-10-15 03:26:53,489 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:26:53,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 4008 transitions. [2019-10-15 03:26:53,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-15 03:26:53,490 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:53,490 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:53,490 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:53,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:53,491 INFO L82 PathProgramCache]: Analyzing trace with hash 773265745, now seen corresponding path program 1 times [2019-10-15 03:26:53,491 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:53,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779815414] [2019-10-15 03:26:53,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,491 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:53,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:53,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:53,587 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779815414] [2019-10-15 03:26:53,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:53,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:26:53,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544671257] [2019-10-15 03:26:53,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:26:53,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:53,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:26:53,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:26:53,590 INFO L87 Difference]: Start difference. First operand 2571 states and 4008 transitions. Second operand 4 states. [2019-10-15 03:26:53,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:53,784 INFO L93 Difference]: Finished difference Result 5080 states and 7937 transitions. [2019-10-15 03:26:53,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:26:53,785 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 56 [2019-10-15 03:26:53,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:53,797 INFO L225 Difference]: With dead ends: 5080 [2019-10-15 03:26:53,797 INFO L226 Difference]: Without dead ends: 2573 [2019-10-15 03:26:53,809 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:26:53,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-15 03:26:53,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-15 03:26:53,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-15 03:26:53,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3996 transitions. [2019-10-15 03:26:53,957 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3996 transitions. Word has length 56 [2019-10-15 03:26:53,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:53,959 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3996 transitions. [2019-10-15 03:26:53,959 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:26:53,959 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3996 transitions. [2019-10-15 03:26:53,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-15 03:26:53,959 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:53,960 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:53,960 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:53,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:53,960 INFO L82 PathProgramCache]: Analyzing trace with hash -1410596863, now seen corresponding path program 1 times [2019-10-15 03:26:53,961 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:53,961 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993497103] [2019-10-15 03:26:53,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,961 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:53,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:54,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:54,318 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993497103] [2019-10-15 03:26:54,318 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:54,319 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:54,319 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11065287] [2019-10-15 03:26:54,319 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:54,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:54,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:54,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:54,320 INFO L87 Difference]: Start difference. First operand 2571 states and 3996 transitions. Second operand 5 states. [2019-10-15 03:26:54,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:54,578 INFO L93 Difference]: Finished difference Result 5080 states and 7913 transitions. [2019-10-15 03:26:54,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:54,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2019-10-15 03:26:54,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:54,592 INFO L225 Difference]: With dead ends: 5080 [2019-10-15 03:26:54,592 INFO L226 Difference]: Without dead ends: 2573 [2019-10-15 03:26:54,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:26:54,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2573 states. [2019-10-15 03:26:54,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2573 to 2571. [2019-10-15 03:26:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-15 03:26:54,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3988 transitions. [2019-10-15 03:26:54,750 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3988 transitions. Word has length 58 [2019-10-15 03:26:54,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:54,750 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3988 transitions. [2019-10-15 03:26:54,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:54,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3988 transitions. [2019-10-15 03:26:54,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-10-15 03:26:54,751 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:54,751 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:54,751 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:54,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:54,752 INFO L82 PathProgramCache]: Analyzing trace with hash 1114339215, now seen corresponding path program 1 times [2019-10-15 03:26:54,752 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:54,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989942320] [2019-10-15 03:26:54,752 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:54,753 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:54,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:54,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:54,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989942320] [2019-10-15 03:26:54,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:54,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:26:54,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822198911] [2019-10-15 03:26:54,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:26:54,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:54,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:26:54,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:54,907 INFO L87 Difference]: Start difference. First operand 2571 states and 3988 transitions. Second operand 5 states. [2019-10-15 03:26:55,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:55,224 INFO L93 Difference]: Finished difference Result 6291 states and 9761 transitions. [2019-10-15 03:26:55,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:26:55,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 61 [2019-10-15 03:26:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:55,243 INFO L225 Difference]: With dead ends: 6291 [2019-10-15 03:26:55,243 INFO L226 Difference]: Without dead ends: 3784 [2019-10-15 03:26:55,249 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:26:55,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3784 states. [2019-10-15 03:26:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3784 to 2571. [2019-10-15 03:26:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2571 states. [2019-10-15 03:26:55,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2571 states to 2571 states and 3987 transitions. [2019-10-15 03:26:55,427 INFO L78 Accepts]: Start accepts. Automaton has 2571 states and 3987 transitions. Word has length 61 [2019-10-15 03:26:55,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:55,428 INFO L462 AbstractCegarLoop]: Abstraction has 2571 states and 3987 transitions. [2019-10-15 03:26:55,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:26:55,428 INFO L276 IsEmpty]: Start isEmpty. Operand 2571 states and 3987 transitions. [2019-10-15 03:26:55,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-15 03:26:55,429 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:55,429 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:55,429 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:55,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:55,430 INFO L82 PathProgramCache]: Analyzing trace with hash 195201472, now seen corresponding path program 1 times [2019-10-15 03:26:55,430 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:55,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308707430] [2019-10-15 03:26:55,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,430 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:55,430 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:55,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:55,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308707430] [2019-10-15 03:26:55,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:26:55,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 03:26:55,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026348394] [2019-10-15 03:26:55,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 03:26:55,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:26:55,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 03:26:55,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:26:55,552 INFO L87 Difference]: Start difference. First operand 2571 states and 3987 transitions. Second operand 7 states. [2019-10-15 03:26:56,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:26:56,212 INFO L93 Difference]: Finished difference Result 7282 states and 11293 transitions. [2019-10-15 03:26:56,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-15 03:26:56,213 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2019-10-15 03:26:56,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:26:56,250 INFO L225 Difference]: With dead ends: 7282 [2019-10-15 03:26:56,250 INFO L226 Difference]: Without dead ends: 5543 [2019-10-15 03:26:56,255 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2019-10-15 03:26:56,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5543 states. [2019-10-15 03:26:56,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5543 to 3604. [2019-10-15 03:26:56,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3604 states. [2019-10-15 03:26:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5435 transitions. [2019-10-15 03:26:56,504 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5435 transitions. Word has length 62 [2019-10-15 03:26:56,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:26:56,505 INFO L462 AbstractCegarLoop]: Abstraction has 3604 states and 5435 transitions. [2019-10-15 03:26:56,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 03:26:56,505 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5435 transitions. [2019-10-15 03:26:56,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-10-15 03:26:56,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:26:56,506 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:26:56,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:26:56,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:26:56,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1719559429, now seen corresponding path program 1 times [2019-10-15 03:26:56,507 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:26:56,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979820569] [2019-10-15 03:26:56,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:26:56,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:26:56,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:57,086 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:57,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979820569] [2019-10-15 03:26:57,087 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973548518] [2019-10-15 03:26:57,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-15 03:26:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:26:57,283 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 41 conjunts are in the unsatisfiable core [2019-10-15 03:26:57,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-15 03:26:57,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,727 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,803 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,806 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,859 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,863 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,873 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:57,984 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:26:57,984 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-15 03:26:58,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,013 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,029 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,032 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,034 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,041 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,050 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,063 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,241 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 28 [2019-10-15 03:26:58,243 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:58,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,245 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,246 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,247 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,468 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 43 [2019-10-15 03:26:58,471 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:58,472 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,473 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,475 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,476 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,477 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,479 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,933 WARN L191 SmtUtils]: Spent 403.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 62 [2019-10-15 03:26:58,958 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 03:26:58,970 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:58,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:58,974 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:58,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:59,278 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-15 03:26:59,281 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:59,283 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:59,434 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-15 03:26:59,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:59,636 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:59,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:59,732 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-15 03:26:59,733 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:59,854 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:59,855 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:26:59,856 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-15 03:26:59,964 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-15 03:27:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:00,098 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1476516209] [2019-10-15 03:27:00,125 INFO L162 IcfgInterpreter]: Started Sifa with 63 locations of interest [2019-10-15 03:27:00,126 INFO L169 IcfgInterpreter]: Building call graph [2019-10-15 03:27:00,131 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-15 03:27:00,140 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-15 03:27:00,141 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-15 03:27:00,664 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-15 03:27:00,823 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-15 03:27:00,959 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 234 [2019-10-15 03:27:01,427 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 282 for LOIs [2019-10-15 03:27:01,725 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 292 [2019-10-15 03:27:01,980 WARN L191 SmtUtils]: Spent 253.00 ms on a formula simplification that was a NOOP. DAG size: 410 [2019-10-15 03:27:02,587 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification that was a NOOP. DAG size: 455 [2019-10-15 03:27:02,593 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 12