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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:26:59,571 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:26:59,574 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:26:59,587 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:26:59,587 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:26:59,590 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:26:59,592 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:26:59,601 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:26:59,605 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:26:59,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:26:59,607 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:26:59,609 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:26:59,609 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:26:59,612 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:26:59,613 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:26:59,615 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:26:59,615 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:26:59,619 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:26:59,621 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:26:59,625 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:26:59,627 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:26:59,628 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:26:59,630 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:26:59,631 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:26:59,635 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:26:59,635 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:26:59,636 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:26:59,638 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:26:59,639 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:26:59,641 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:26:59,641 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:26:59,643 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:26:59,644 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:26:59,644 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:26:59,648 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:26:59,649 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:26:59,649 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:26:59,650 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:26:59,650 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:26:59,652 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:26:59,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:26:59,656 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:59,682 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:26:59,682 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:26:59,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:26:59,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:26:59,687 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:26:59,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:26:59,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:26:59,687 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:26:59,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:26:59,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:26:59,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:26:59,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:26:59,688 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:26:59,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:26:59,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:26:59,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:26:59,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:26:59,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:26:59,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:26:59,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:26:59,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:26:59,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:26:59,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:26:59,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:26:59,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:26:59,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:26:59,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:26:59,693 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:26:59,694 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:27:00,007 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:27:00,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:27:00,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:27:00,025 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:27:00,026 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:27:00,026 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.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:27:00,094 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba5462c/4aaf44145fd2439e828b94be5315c81d/FLAG69fb520b8 [2019-10-15 03:27:00,659 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:27:00,661 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:27:00,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba5462c/4aaf44145fd2439e828b94be5315c81d/FLAG69fb520b8 [2019-10-15 03:27:00,940 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5dba5462c/4aaf44145fd2439e828b94be5315c81d [2019-10-15 03:27:00,951 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:27:00,952 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:27:00,953 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:00,953 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:27:00,956 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:27:00,957 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:00" (1/1) ... [2019-10-15 03:27:00,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b5d4e77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:00, skipping insertion in model container [2019-10-15 03:27:00,960 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:27:00" (1/1) ... [2019-10-15 03:27:00,968 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:27:01,039 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:27:01,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:01,724 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:27:02,154 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:27:02,179 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:27:02,180 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02 WrapperNode [2019-10-15 03:27:02,180 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:27:02,180 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:27:02,180 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:27:02,181 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:27:02,191 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,212 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,212 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,244 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,269 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (1/1) ... [2019-10-15 03:27:02,286 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:27:02,287 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:27:02,287 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:27:02,288 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:27:02,292 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (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:27:02,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:27:02,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:27:02,387 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:27:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:27:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-15 03:27:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-15 03:27:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-15 03:27:02,388 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-15 03:27:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-15 03:27:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-15 03:27:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-15 03:27:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-15 03:27:02,389 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-15 03:27:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-15 03:27:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-15 03:27:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-15 03:27:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:27:02,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:27:02,391 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:27:05,301 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:27:05,301 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-15 03:27:05,304 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:05 BoogieIcfgContainer [2019-10-15 03:27:05,304 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:27:05,305 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:27:05,305 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:27:05,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:27:05,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:27:00" (1/3) ... [2019-10-15 03:27:05,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1a0b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:05, skipping insertion in model container [2019-10-15 03:27:05,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:27:02" (2/3) ... [2019-10-15 03:27:05,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a1a0b51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:27:05, skipping insertion in model container [2019-10-15 03:27:05,312 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:27:05" (3/3) ... [2019-10-15 03:27:05,314 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.UNBOUNDED.pals.c.v+lhb-reducer.c [2019-10-15 03:27:05,325 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:27:05,336 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-15 03:27:05,351 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-15 03:27:05,386 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:27:05,386 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:27:05,387 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:27:05,387 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:27:05,387 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:27:05,387 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:27:05,387 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:27:05,388 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:27:05,418 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states. [2019-10-15 03:27:05,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-15 03:27:05,434 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:05,435 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:05,437 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:05,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:05,444 INFO L82 PathProgramCache]: Analyzing trace with hash -88145364, now seen corresponding path program 1 times [2019-10-15 03:27:05,453 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:05,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855327825] [2019-10-15 03:27:05,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,454 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:05,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:06,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:06,735 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:27:06,737 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855327825] [2019-10-15 03:27:06,738 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:06,738 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:27:06,739 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017442993] [2019-10-15 03:27:06,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:27:06,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:06,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:27:06,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:27:06,764 INFO L87 Difference]: Start difference. First operand 320 states. Second operand 6 states. [2019-10-15 03:27:07,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:07,046 INFO L93 Difference]: Finished difference Result 834 states and 1461 transitions. [2019-10-15 03:27:07,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:07,048 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 123 [2019-10-15 03:27:07,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:07,076 INFO L225 Difference]: With dead ends: 834 [2019-10-15 03:27:07,076 INFO L226 Difference]: Without dead ends: 567 [2019-10-15 03:27:07,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:27:07,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2019-10-15 03:27:07,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 545. [2019-10-15 03:27:07,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2019-10-15 03:27:07,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 723 transitions. [2019-10-15 03:27:07,226 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 723 transitions. Word has length 123 [2019-10-15 03:27:07,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:07,227 INFO L462 AbstractCegarLoop]: Abstraction has 545 states and 723 transitions. [2019-10-15 03:27:07,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:27:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 723 transitions. [2019-10-15 03:27:07,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:27:07,238 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:07,239 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:07,240 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:07,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:07,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1796124794, now seen corresponding path program 1 times [2019-10-15 03:27:07,242 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:07,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453152894] [2019-10-15 03:27:07,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:07,352 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:27:07,352 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453152894] [2019-10-15 03:27:07,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:07,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:07,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363332371] [2019-10-15 03:27:07,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:07,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:07,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:07,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:07,355 INFO L87 Difference]: Start difference. First operand 545 states and 723 transitions. Second operand 3 states. [2019-10-15 03:27:07,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:07,438 INFO L93 Difference]: Finished difference Result 1238 states and 1691 transitions. [2019-10-15 03:27:07,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:07,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-15 03:27:07,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:07,443 INFO L225 Difference]: With dead ends: 1238 [2019-10-15 03:27:07,444 INFO L226 Difference]: Without dead ends: 737 [2019-10-15 03:27:07,446 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:27:07,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-10-15 03:27:07,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 652. [2019-10-15 03:27:07,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 652 states. [2019-10-15 03:27:07,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 652 states to 652 states and 896 transitions. [2019-10-15 03:27:07,477 INFO L78 Accepts]: Start accepts. Automaton has 652 states and 896 transitions. Word has length 125 [2019-10-15 03:27:07,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:07,477 INFO L462 AbstractCegarLoop]: Abstraction has 652 states and 896 transitions. [2019-10-15 03:27:07,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:07,478 INFO L276 IsEmpty]: Start isEmpty. Operand 652 states and 896 transitions. [2019-10-15 03:27:07,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-10-15 03:27:07,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:07,480 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:07,480 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:07,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:07,481 INFO L82 PathProgramCache]: Analyzing trace with hash -254745606, now seen corresponding path program 1 times [2019-10-15 03:27:07,481 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:07,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341206642] [2019-10-15 03:27:07,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:07,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:27:07,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341206642] [2019-10-15 03:27:07,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:07,589 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:07,589 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333128461] [2019-10-15 03:27:07,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:07,590 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:07,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:07,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:07,591 INFO L87 Difference]: Start difference. First operand 652 states and 896 transitions. Second operand 3 states. [2019-10-15 03:27:07,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:07,767 INFO L93 Difference]: Finished difference Result 1509 states and 2134 transitions. [2019-10-15 03:27:07,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:07,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-10-15 03:27:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:07,776 INFO L225 Difference]: With dead ends: 1509 [2019-10-15 03:27:07,777 INFO L226 Difference]: Without dead ends: 925 [2019-10-15 03:27:07,780 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:27:07,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 925 states. [2019-10-15 03:27:07,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 925 to 853. [2019-10-15 03:27:07,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-15 03:27:07,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1221 transitions. [2019-10-15 03:27:07,839 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1221 transitions. Word has length 125 [2019-10-15 03:27:07,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:07,841 INFO L462 AbstractCegarLoop]: Abstraction has 853 states and 1221 transitions. [2019-10-15 03:27:07,841 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:07,841 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1221 transitions. [2019-10-15 03:27:07,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 03:27:07,844 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:07,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:07,846 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:07,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:07,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1233192348, now seen corresponding path program 1 times [2019-10-15 03:27:07,848 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:07,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262329157] [2019-10-15 03:27:07,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:07,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:08,073 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:27:08,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262329157] [2019-10-15 03:27:08,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:08,075 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 03:27:08,075 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630692046] [2019-10-15 03:27:08,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 03:27:08,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:08,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 03:27:08,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-15 03:27:08,077 INFO L87 Difference]: Start difference. First operand 853 states and 1221 transitions. Second operand 6 states. [2019-10-15 03:27:08,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:08,543 INFO L93 Difference]: Finished difference Result 2178 states and 3205 transitions. [2019-10-15 03:27:08,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:08,544 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 128 [2019-10-15 03:27:08,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:08,552 INFO L225 Difference]: With dead ends: 2178 [2019-10-15 03:27:08,552 INFO L226 Difference]: Without dead ends: 1367 [2019-10-15 03:27:08,555 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-10-15 03:27:08,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2019-10-15 03:27:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1275. [2019-10-15 03:27:08,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1275 states. [2019-10-15 03:27:08,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1275 states to 1275 states and 1897 transitions. [2019-10-15 03:27:08,680 INFO L78 Accepts]: Start accepts. Automaton has 1275 states and 1897 transitions. Word has length 128 [2019-10-15 03:27:08,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:08,681 INFO L462 AbstractCegarLoop]: Abstraction has 1275 states and 1897 transitions. [2019-10-15 03:27:08,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 03:27:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1275 states and 1897 transitions. [2019-10-15 03:27:08,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 03:27:08,683 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:08,683 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:08,684 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:08,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:08,684 INFO L82 PathProgramCache]: Analyzing trace with hash 1281543543, now seen corresponding path program 1 times [2019-10-15 03:27:08,684 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:08,685 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465951851] [2019-10-15 03:27:08,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:08,685 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:08,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:08,811 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:27:08,812 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465951851] [2019-10-15 03:27:08,812 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:08,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:08,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886834858] [2019-10-15 03:27:08,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:08,813 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:08,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:08,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:08,814 INFO L87 Difference]: Start difference. First operand 1275 states and 1897 transitions. Second operand 3 states. [2019-10-15 03:27:08,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:08,962 INFO L93 Difference]: Finished difference Result 2434 states and 3639 transitions. [2019-10-15 03:27:08,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:08,963 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-10-15 03:27:08,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:08,975 INFO L225 Difference]: With dead ends: 2434 [2019-10-15 03:27:08,975 INFO L226 Difference]: Without dead ends: 1876 [2019-10-15 03:27:08,977 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:27:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2019-10-15 03:27:09,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1854. [2019-10-15 03:27:09,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1854 states. [2019-10-15 03:27:09,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 2754 transitions. [2019-10-15 03:27:09,097 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 2754 transitions. Word has length 128 [2019-10-15 03:27:09,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:09,099 INFO L462 AbstractCegarLoop]: Abstraction has 1854 states and 2754 transitions. [2019-10-15 03:27:09,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 2754 transitions. [2019-10-15 03:27:09,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 03:27:09,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:09,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:09,102 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:09,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:09,102 INFO L82 PathProgramCache]: Analyzing trace with hash -333562049, now seen corresponding path program 1 times [2019-10-15 03:27:09,102 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:09,103 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261091302] [2019-10-15 03:27:09,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:09,103 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:09,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:09,610 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:27:09,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261091302] [2019-10-15 03:27:09,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:09,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:09,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773981185] [2019-10-15 03:27:09,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:09,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:09,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:09,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:09,613 INFO L87 Difference]: Start difference. First operand 1854 states and 2754 transitions. Second operand 5 states. [2019-10-15 03:27:09,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:09,911 INFO L93 Difference]: Finished difference Result 5295 states and 7912 transitions. [2019-10-15 03:27:09,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:09,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-15 03:27:09,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:09,930 INFO L225 Difference]: With dead ends: 5295 [2019-10-15 03:27:09,930 INFO L226 Difference]: Without dead ends: 3548 [2019-10-15 03:27:09,935 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:27:09,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2019-10-15 03:27:10,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3526. [2019-10-15 03:27:10,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3526 states. [2019-10-15 03:27:10,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3526 states to 3526 states and 5217 transitions. [2019-10-15 03:27:10,252 INFO L78 Accepts]: Start accepts. Automaton has 3526 states and 5217 transitions. Word has length 128 [2019-10-15 03:27:10,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:10,254 INFO L462 AbstractCegarLoop]: Abstraction has 3526 states and 5217 transitions. [2019-10-15 03:27:10,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:10,254 INFO L276 IsEmpty]: Start isEmpty. Operand 3526 states and 5217 transitions. [2019-10-15 03:27:10,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-15 03:27:10,257 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:10,258 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:10,259 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:10,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:10,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1525850627, now seen corresponding path program 1 times [2019-10-15 03:27:10,259 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:10,260 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987538368] [2019-10-15 03:27:10,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:10,260 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:10,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:10,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:10,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:10,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987538368] [2019-10-15 03:27:10,355 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:10,355 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:10,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541530805] [2019-10-15 03:27:10,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:10,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:10,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:10,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:10,358 INFO L87 Difference]: Start difference. First operand 3526 states and 5217 transitions. Second operand 3 states. [2019-10-15 03:27:10,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:10,799 INFO L93 Difference]: Finished difference Result 9122 states and 13744 transitions. [2019-10-15 03:27:10,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:10,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-10-15 03:27:10,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:10,828 INFO L225 Difference]: With dead ends: 9122 [2019-10-15 03:27:10,829 INFO L226 Difference]: Without dead ends: 5742 [2019-10-15 03:27:10,839 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:27:10,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5742 states. [2019-10-15 03:27:11,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5742 to 5558. [2019-10-15 03:27:11,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-15 03:27:11,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8399 transitions. [2019-10-15 03:27:11,342 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8399 transitions. Word has length 130 [2019-10-15 03:27:11,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:11,342 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8399 transitions. [2019-10-15 03:27:11,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:11,343 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8399 transitions. [2019-10-15 03:27:11,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:27:11,347 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:11,347 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:11,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:11,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:11,348 INFO L82 PathProgramCache]: Analyzing trace with hash -2057522103, now seen corresponding path program 1 times [2019-10-15 03:27:11,348 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:11,348 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141774329] [2019-10-15 03:27:11,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:11,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:11,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:11,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:11,498 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:27:11,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141774329] [2019-10-15 03:27:11,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:11,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:11,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181710932] [2019-10-15 03:27:11,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:11,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:11,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:11,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:11,501 INFO L87 Difference]: Start difference. First operand 5558 states and 8399 transitions. Second operand 5 states. [2019-10-15 03:27:12,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:12,131 INFO L93 Difference]: Finished difference Result 10982 states and 16629 transitions. [2019-10-15 03:27:12,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:12,132 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 03:27:12,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:12,161 INFO L225 Difference]: With dead ends: 10982 [2019-10-15 03:27:12,161 INFO L226 Difference]: Without dead ends: 5558 [2019-10-15 03:27:12,179 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-15 03:27:12,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5558 states. [2019-10-15 03:27:12,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5558 to 5558. [2019-10-15 03:27:12,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5558 states. [2019-10-15 03:27:12,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5558 states to 5558 states and 8279 transitions. [2019-10-15 03:27:12,549 INFO L78 Accepts]: Start accepts. Automaton has 5558 states and 8279 transitions. Word has length 133 [2019-10-15 03:27:12,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:12,549 INFO L462 AbstractCegarLoop]: Abstraction has 5558 states and 8279 transitions. [2019-10-15 03:27:12,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:12,550 INFO L276 IsEmpty]: Start isEmpty. Operand 5558 states and 8279 transitions. [2019-10-15 03:27:12,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:27:12,553 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:12,553 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:12,554 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:12,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:12,554 INFO L82 PathProgramCache]: Analyzing trace with hash 100294532, now seen corresponding path program 1 times [2019-10-15 03:27:12,554 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:12,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086929280] [2019-10-15 03:27:12,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:12,555 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:12,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:12,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:13,068 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:27:13,069 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086929280] [2019-10-15 03:27:13,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:13,070 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:13,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016166759] [2019-10-15 03:27:13,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:13,071 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:13,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:13,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:13,072 INFO L87 Difference]: Start difference. First operand 5558 states and 8279 transitions. Second operand 5 states. [2019-10-15 03:27:13,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:13,418 INFO L93 Difference]: Finished difference Result 6461 states and 9604 transitions. [2019-10-15 03:27:13,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:13,419 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 03:27:13,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:13,462 INFO L225 Difference]: With dead ends: 6461 [2019-10-15 03:27:13,462 INFO L226 Difference]: Without dead ends: 4735 [2019-10-15 03:27:13,468 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:27:13,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-10-15 03:27:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 4696. [2019-10-15 03:27:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4696 states. [2019-10-15 03:27:13,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4696 states to 4696 states and 7003 transitions. [2019-10-15 03:27:13,822 INFO L78 Accepts]: Start accepts. Automaton has 4696 states and 7003 transitions. Word has length 133 [2019-10-15 03:27:13,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:13,822 INFO L462 AbstractCegarLoop]: Abstraction has 4696 states and 7003 transitions. [2019-10-15 03:27:13,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:13,822 INFO L276 IsEmpty]: Start isEmpty. Operand 4696 states and 7003 transitions. [2019-10-15 03:27:13,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-15 03:27:13,826 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:13,826 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:13,826 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash -1643558573, now seen corresponding path program 1 times [2019-10-15 03:27:13,828 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:13,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167811896] [2019-10-15 03:27:13,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:13,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:14,164 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:27:14,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167811896] [2019-10-15 03:27:14,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:14,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:14,165 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702938657] [2019-10-15 03:27:14,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:14,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:14,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:14,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:14,167 INFO L87 Difference]: Start difference. First operand 4696 states and 7003 transitions. Second operand 5 states. [2019-10-15 03:27:14,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:14,819 INFO L93 Difference]: Finished difference Result 13582 states and 20369 transitions. [2019-10-15 03:27:14,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:14,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-15 03:27:14,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:14,846 INFO L225 Difference]: With dead ends: 13582 [2019-10-15 03:27:14,846 INFO L226 Difference]: Without dead ends: 9053 [2019-10-15 03:27:14,860 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 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:27:14,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9053 states. [2019-10-15 03:27:15,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9053 to 9031. [2019-10-15 03:27:15,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9031 states. [2019-10-15 03:27:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9031 states to 9031 states and 13457 transitions. [2019-10-15 03:27:15,529 INFO L78 Accepts]: Start accepts. Automaton has 9031 states and 13457 transitions. Word has length 133 [2019-10-15 03:27:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:15,529 INFO L462 AbstractCegarLoop]: Abstraction has 9031 states and 13457 transitions. [2019-10-15 03:27:15,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:15,529 INFO L276 IsEmpty]: Start isEmpty. Operand 9031 states and 13457 transitions. [2019-10-15 03:27:15,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 03:27:15,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:15,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:15,535 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:15,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:15,535 INFO L82 PathProgramCache]: Analyzing trace with hash -640634061, now seen corresponding path program 1 times [2019-10-15 03:27:15,536 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:15,536 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997614155] [2019-10-15 03:27:15,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:15,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:15,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:15,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:27:15,669 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997614155] [2019-10-15 03:27:15,669 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:15,669 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-15 03:27:15,670 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892775303] [2019-10-15 03:27:15,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-15 03:27:15,670 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:15,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-15 03:27:15,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-15 03:27:15,671 INFO L87 Difference]: Start difference. First operand 9031 states and 13457 transitions. Second operand 3 states. [2019-10-15 03:27:16,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:16,371 INFO L93 Difference]: Finished difference Result 16931 states and 25211 transitions. [2019-10-15 03:27:16,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-15 03:27:16,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 138 [2019-10-15 03:27:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:16,424 INFO L225 Difference]: With dead ends: 16931 [2019-10-15 03:27:16,424 INFO L226 Difference]: Without dead ends: 12631 [2019-10-15 03:27:16,437 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:27:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12631 states. [2019-10-15 03:27:17,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12631 to 12609. [2019-10-15 03:27:17,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12609 states. [2019-10-15 03:27:17,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 18567 transitions. [2019-10-15 03:27:17,255 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 18567 transitions. Word has length 138 [2019-10-15 03:27:17,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:17,256 INFO L462 AbstractCegarLoop]: Abstraction has 12609 states and 18567 transitions. [2019-10-15 03:27:17,256 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-15 03:27:17,256 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 18567 transitions. [2019-10-15 03:27:17,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 03:27:17,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:17,263 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:17,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:17,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:17,264 INFO L82 PathProgramCache]: Analyzing trace with hash 1935605800, now seen corresponding path program 1 times [2019-10-15 03:27:17,264 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:17,264 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126805885] [2019-10-15 03:27:17,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,264 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:17,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:17,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:17,693 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:27:17,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126805885] [2019-10-15 03:27:17,694 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:17,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 03:27:17,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974837366] [2019-10-15 03:27:17,695 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 03:27:17,695 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 03:27:17,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-15 03:27:17,696 INFO L87 Difference]: Start difference. First operand 12609 states and 18567 transitions. Second operand 5 states. [2019-10-15 03:27:18,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:27:18,915 INFO L93 Difference]: Finished difference Result 20979 states and 31100 transitions. [2019-10-15 03:27:18,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-15 03:27:18,916 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-15 03:27:18,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:27:18,944 INFO L225 Difference]: With dead ends: 20979 [2019-10-15 03:27:18,945 INFO L226 Difference]: Without dead ends: 12688 [2019-10-15 03:27:18,961 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 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:27:18,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12688 states. [2019-10-15 03:27:19,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12688 to 12612. [2019-10-15 03:27:19,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12612 states. [2019-10-15 03:27:19,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12612 states to 12612 states and 18570 transitions. [2019-10-15 03:27:19,643 INFO L78 Accepts]: Start accepts. Automaton has 12612 states and 18570 transitions. Word has length 138 [2019-10-15 03:27:19,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:27:19,644 INFO L462 AbstractCegarLoop]: Abstraction has 12612 states and 18570 transitions. [2019-10-15 03:27:19,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 03:27:19,644 INFO L276 IsEmpty]: Start isEmpty. Operand 12612 states and 18570 transitions. [2019-10-15 03:27:19,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-15 03:27:19,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:27:19,651 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:27:19,651 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:27:19,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:27:19,652 INFO L82 PathProgramCache]: Analyzing trace with hash 407147818, now seen corresponding path program 1 times [2019-10-15 03:27:19,652 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:27:19,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864689214] [2019-10-15 03:27:19,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,653 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:27:19,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:27:19,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:27:20,770 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2019-10-15 03:27:21,006 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2019-10-15 03:27:21,141 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 54 [2019-10-15 03:27:21,287 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-10-15 03:27:21,440 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-15 03:27:21,599 WARN L191 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 65 [2019-10-15 03:27:21,799 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-10-15 03:27:21,974 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-15 03:27:22,164 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-15 03:27:22,364 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 64 [2019-10-15 03:27:22,523 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 63 [2019-10-15 03:27:22,714 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-15 03:27:22,871 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-10-15 03:27:23,193 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 63 [2019-10-15 03:27:23,844 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-10-15 03:27:24,377 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 52 [2019-10-15 03:27:24,621 WARN L191 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 47 [2019-10-15 03:27:25,582 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:27:25,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864689214] [2019-10-15 03:27:25,583 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:27:25,583 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-10-15 03:27:25,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [813186166] [2019-10-15 03:27:25,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-15 03:27:25,584 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:27:25,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-15 03:27:25,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2019-10-15 03:27:25,585 INFO L87 Difference]: Start difference. First operand 12612 states and 18570 transitions. Second operand 34 states. [2019-10-15 03:27:26,155 WARN L191 SmtUtils]: Spent 502.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 87 [2019-10-15 03:27:26,707 WARN L191 SmtUtils]: Spent 462.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 79 [2019-10-15 03:27:27,456 WARN L191 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2019-10-15 03:27:27,677 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2019-10-15 03:27:27,865 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 54 [2019-10-15 03:27:28,145 WARN L191 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 61 [2019-10-15 03:27:28,613 WARN L191 SmtUtils]: Spent 392.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-10-15 03:27:28,999 WARN L191 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 71 [2019-10-15 03:27:29,571 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 77 [2019-10-15 03:27:30,188 WARN L191 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 74 [2019-10-15 03:27:30,857 WARN L191 SmtUtils]: Spent 522.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 80 [2019-10-15 03:27:31,571 WARN L191 SmtUtils]: Spent 506.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 81 [2019-10-15 03:27:32,488 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 80 [2019-10-15 03:27:33,106 WARN L191 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 77 [2019-10-15 03:27:33,813 WARN L191 SmtUtils]: Spent 469.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 83 [2019-10-15 03:27:34,393 WARN L191 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 82 [2019-10-15 03:27:35,204 WARN L191 SmtUtils]: Spent 459.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 82