java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:46,319 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:46,321 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:46,334 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:46,334 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:46,336 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:46,337 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:46,339 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:46,340 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:46,341 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:46,342 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:46,343 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:46,344 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:46,345 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:46,346 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:46,347 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:46,347 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:46,349 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:46,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:46,355 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:46,357 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:46,358 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:46,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:46,364 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:46,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:46,367 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:46,367 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:46,369 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:46,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:46,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:46,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:46,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:46,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:46,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:46,379 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:46,379 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:46,380 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:46,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:46,381 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:46,382 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:46,384 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:46,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 23:21:46,404 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:46,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:46,406 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:46,407 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:46,407 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:46,407 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:46,407 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:46,407 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:46,408 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:46,408 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:46,409 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:46,409 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:46,409 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:46,410 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:46,410 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:46,410 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:46,410 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:46,411 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:46,411 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:46,411 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:46,411 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:46,411 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:46,411 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:46,412 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:46,412 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:46,412 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:46,412 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:46,412 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:46,413 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 23:21:46,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:46,752 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:46,757 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:46,758 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:46,758 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:46,759 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 23:21:46,819 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1457369/8299d26be9f4487f826f2407b313d2c4/FLAG8958cf011 [2019-10-13 23:21:47,371 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:47,372 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 23:21:47,391 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1457369/8299d26be9f4487f826f2407b313d2c4/FLAG8958cf011 [2019-10-13 23:21:47,698 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e1457369/8299d26be9f4487f826f2407b313d2c4 [2019-10-13 23:21:47,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:47,712 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:47,716 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:47,716 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:47,720 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:47,721 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:47" (1/1) ... [2019-10-13 23:21:47,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75ddb1c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:47, skipping insertion in model container [2019-10-13 23:21:47,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:47" (1/1) ... [2019-10-13 23:21:47,729 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:47,788 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:48,114 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:48,222 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:48,327 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:48,346 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:48,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48 WrapperNode [2019-10-13 23:21:48,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:48,348 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:48,348 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:48,348 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:48,358 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,369 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,370 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,385 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,395 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... [2019-10-13 23:21:48,404 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:48,405 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:48,405 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:48,405 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:48,406 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:48,465 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:48,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:48,466 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:48,466 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-10-13 23:21:48,467 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:48,468 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:48,469 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:48,470 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:48,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:49,705 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:49,705 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:49,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:49 BoogieIcfgContainer [2019-10-13 23:21:49,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:49,708 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:49,708 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:49,711 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:49,712 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:47" (1/3) ... [2019-10-13 23:21:49,712 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33df42b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:49, skipping insertion in model container [2019-10-13 23:21:49,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:48" (2/3) ... [2019-10-13 23:21:49,713 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33df42b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:49, skipping insertion in model container [2019-10-13 23:21:49,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:49" (3/3) ... [2019-10-13 23:21:49,715 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.3.2.ufo.UNBOUNDED.pals.c.v+nlh-reducer.c [2019-10-13 23:21:49,725 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:49,734 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 23:21:49,746 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 23:21:49,774 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:49,774 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:49,775 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:49,775 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:49,775 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:49,775 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:49,775 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:49,776 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:49,798 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2019-10-13 23:21:49,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-10-13 23:21:49,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:49,808 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-13 23:21:49,810 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:49,816 INFO L82 PathProgramCache]: Analyzing trace with hash -787153264, now seen corresponding path program 1 times [2019-10-13 23:21:49,826 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:49,827 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006460546] [2019-10-13 23:21:49,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:49,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:50,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:50,396 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006460546] [2019-10-13 23:21:50,397 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:50,398 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:50,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924906439] [2019-10-13 23:21:50,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:50,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:50,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:50,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:50,424 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 5 states. [2019-10-13 23:21:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:50,730 INFO L93 Difference]: Finished difference Result 292 states and 460 transitions. [2019-10-13 23:21:50,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:50,732 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-10-13 23:21:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:50,756 INFO L225 Difference]: With dead ends: 292 [2019-10-13 23:21:50,757 INFO L226 Difference]: Without dead ends: 212 [2019-10-13 23:21:50,764 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2019-10-13 23:21:50,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 208. [2019-10-13 23:21:50,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 23:21:50,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 276 transitions. [2019-10-13 23:21:50,903 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 276 transitions. Word has length 45 [2019-10-13 23:21:50,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:50,904 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 276 transitions. [2019-10-13 23:21:50,904 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:50,905 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 276 transitions. [2019-10-13 23:21:50,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:21:50,908 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:50,908 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] [2019-10-13 23:21:50,908 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:50,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:50,910 INFO L82 PathProgramCache]: Analyzing trace with hash 422949447, now seen corresponding path program 1 times [2019-10-13 23:21:50,910 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:50,910 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721629063] [2019-10-13 23:21:50,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,911 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:50,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,077 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721629063] [2019-10-13 23:21:51,078 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,078 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:51,078 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443671154] [2019-10-13 23:21:51,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:51,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:51,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:51,083 INFO L87 Difference]: Start difference. First operand 208 states and 276 transitions. Second operand 6 states. [2019-10-13 23:21:51,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:51,261 INFO L93 Difference]: Finished difference Result 347 states and 464 transitions. [2019-10-13 23:21:51,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:51,262 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-13 23:21:51,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:51,264 INFO L225 Difference]: With dead ends: 347 [2019-10-13 23:21:51,264 INFO L226 Difference]: Without dead ends: 208 [2019-10-13 23:21:51,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:51,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-13 23:21:51,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-13 23:21:51,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 23:21:51,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 266 transitions. [2019-10-13 23:21:51,288 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 266 transitions. Word has length 46 [2019-10-13 23:21:51,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,289 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 266 transitions. [2019-10-13 23:21:51,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:51,289 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 266 transitions. [2019-10-13 23:21:51,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-13 23:21:51,291 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,291 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] [2019-10-13 23:21:51,291 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,292 INFO L82 PathProgramCache]: Analyzing trace with hash -752893704, now seen corresponding path program 1 times [2019-10-13 23:21:51,292 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392559093] [2019-10-13 23:21:51,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,292 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,385 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392559093] [2019-10-13 23:21:51,385 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,385 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 23:21:51,385 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137630865] [2019-10-13 23:21:51,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 23:21:51,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 23:21:51,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-10-13 23:21:51,387 INFO L87 Difference]: Start difference. First operand 208 states and 266 transitions. Second operand 6 states. [2019-10-13 23:21:51,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:51,531 INFO L93 Difference]: Finished difference Result 372 states and 478 transitions. [2019-10-13 23:21:51,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:51,533 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2019-10-13 23:21:51,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:51,535 INFO L225 Difference]: With dead ends: 372 [2019-10-13 23:21:51,535 INFO L226 Difference]: Without dead ends: 208 [2019-10-13 23:21:51,538 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-10-13 23:21:51,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-13 23:21:51,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2019-10-13 23:21:51,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2019-10-13 23:21:51,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2019-10-13 23:21:51,567 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 46 [2019-10-13 23:21:51,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:51,568 INFO L462 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2019-10-13 23:21:51,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 23:21:51,568 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2019-10-13 23:21:51,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:21:51,580 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:51,580 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-13 23:21:51,580 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:51,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:51,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1269751131, now seen corresponding path program 1 times [2019-10-13 23:21:51,581 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:51,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165604257] [2019-10-13 23:21:51,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,582 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:51,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:51,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:51,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:51,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165604257] [2019-10-13 23:21:51,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:51,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:51,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129074049] [2019-10-13 23:21:51,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:51,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:51,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:51,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:51,836 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand 10 states. [2019-10-13 23:21:52,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:52,663 INFO L93 Difference]: Finished difference Result 405 states and 502 transitions. [2019-10-13 23:21:52,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:21:52,664 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-13 23:21:52,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:52,666 INFO L225 Difference]: With dead ends: 405 [2019-10-13 23:21:52,666 INFO L226 Difference]: Without dead ends: 380 [2019-10-13 23:21:52,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=203, Unknown=0, NotChecked=0, Total=306 [2019-10-13 23:21:52,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2019-10-13 23:21:52,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 288. [2019-10-13 23:21:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2019-10-13 23:21:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 356 transitions. [2019-10-13 23:21:52,697 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 356 transitions. Word has length 47 [2019-10-13 23:21:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:52,698 INFO L462 AbstractCegarLoop]: Abstraction has 288 states and 356 transitions. [2019-10-13 23:21:52,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 356 transitions. [2019-10-13 23:21:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:21:52,699 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:52,700 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-13 23:21:52,700 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:52,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1608472133, now seen corresponding path program 1 times [2019-10-13 23:21:52,701 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:52,701 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388524575] [2019-10-13 23:21:52,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,701 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:52,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:52,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:52,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388524575] [2019-10-13 23:21:52,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:52,925 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:52,925 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263290651] [2019-10-13 23:21:52,926 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:52,926 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:52,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:52,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:52,927 INFO L87 Difference]: Start difference. First operand 288 states and 356 transitions. Second operand 10 states. [2019-10-13 23:21:53,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:53,460 INFO L93 Difference]: Finished difference Result 498 states and 625 transitions. [2019-10-13 23:21:53,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 23:21:53,460 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2019-10-13 23:21:53,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:53,463 INFO L225 Difference]: With dead ends: 498 [2019-10-13 23:21:53,464 INFO L226 Difference]: Without dead ends: 444 [2019-10-13 23:21:53,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2019-10-13 23:21:53,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2019-10-13 23:21:53,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 350. [2019-10-13 23:21:53,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-13 23:21:53,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 434 transitions. [2019-10-13 23:21:53,496 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 434 transitions. Word has length 47 [2019-10-13 23:21:53,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:53,497 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 434 transitions. [2019-10-13 23:21:53,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:53,498 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 434 transitions. [2019-10-13 23:21:53,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-13 23:21:53,500 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:53,500 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-13 23:21:53,500 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:53,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:53,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1711689862, now seen corresponding path program 1 times [2019-10-13 23:21:53,501 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:53,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585239608] [2019-10-13 23:21:53,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:53,502 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:53,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:53,609 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585239608] [2019-10-13 23:21:53,609 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:53,609 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:53,610 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238945758] [2019-10-13 23:21:53,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:53,610 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:53,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:53,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:53,611 INFO L87 Difference]: Start difference. First operand 350 states and 434 transitions. Second operand 5 states. [2019-10-13 23:21:53,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:53,802 INFO L93 Difference]: Finished difference Result 478 states and 602 transitions. [2019-10-13 23:21:53,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:53,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-13 23:21:53,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:53,807 INFO L225 Difference]: With dead ends: 478 [2019-10-13 23:21:53,808 INFO L226 Difference]: Without dead ends: 350 [2019-10-13 23:21:53,809 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-13 23:21:53,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2019-10-13 23:21:53,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2019-10-13 23:21:53,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2019-10-13 23:21:53,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 433 transitions. [2019-10-13 23:21:53,854 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 433 transitions. Word has length 47 [2019-10-13 23:21:53,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:53,855 INFO L462 AbstractCegarLoop]: Abstraction has 350 states and 433 transitions. [2019-10-13 23:21:53,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:53,855 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 433 transitions. [2019-10-13 23:21:53,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-13 23:21:53,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:53,856 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] [2019-10-13 23:21:53,856 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:53,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:53,857 INFO L82 PathProgramCache]: Analyzing trace with hash 829937832, now seen corresponding path program 1 times [2019-10-13 23:21:53,857 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:53,857 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116508280] [2019-10-13 23:21:53,857 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:53,858 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:53,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:54,103 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116508280] [2019-10-13 23:21:54,103 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:54,104 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 23:21:54,104 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530543209] [2019-10-13 23:21:54,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 23:21:54,105 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:54,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 23:21:54,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:54,105 INFO L87 Difference]: Start difference. First operand 350 states and 433 transitions. Second operand 10 states. [2019-10-13 23:21:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:54,815 INFO L93 Difference]: Finished difference Result 903 states and 1180 transitions. [2019-10-13 23:21:54,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 23:21:54,815 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 48 [2019-10-13 23:21:54,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:54,820 INFO L225 Difference]: With dead ends: 903 [2019-10-13 23:21:54,820 INFO L226 Difference]: Without dead ends: 815 [2019-10-13 23:21:54,821 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=250, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:21:54,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2019-10-13 23:21:54,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 596. [2019-10-13 23:21:54,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 23:21:54,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 760 transitions. [2019-10-13 23:21:54,880 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 760 transitions. Word has length 48 [2019-10-13 23:21:54,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:54,880 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 760 transitions. [2019-10-13 23:21:54,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 23:21:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 760 transitions. [2019-10-13 23:21:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-13 23:21:54,881 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:54,882 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-13 23:21:54,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:54,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1176215270, now seen corresponding path program 1 times [2019-10-13 23:21:54,883 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:54,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069501504] [2019-10-13 23:21:54,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,883 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:54,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:54,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:55,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:55,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069501504] [2019-10-13 23:21:55,124 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:55,124 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:55,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702793164] [2019-10-13 23:21:55,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:55,125 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:55,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:55,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:55,126 INFO L87 Difference]: Start difference. First operand 596 states and 760 transitions. Second operand 12 states. [2019-10-13 23:21:55,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:55,693 INFO L93 Difference]: Finished difference Result 1305 states and 1689 transitions. [2019-10-13 23:21:55,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:21:55,694 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 49 [2019-10-13 23:21:55,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:55,700 INFO L225 Difference]: With dead ends: 1305 [2019-10-13 23:21:55,700 INFO L226 Difference]: Without dead ends: 1253 [2019-10-13 23:21:55,702 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=160, Invalid=302, Unknown=0, NotChecked=0, Total=462 [2019-10-13 23:21:55,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1253 states. [2019-10-13 23:21:55,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1253 to 605. [2019-10-13 23:21:55,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2019-10-13 23:21:55,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 768 transitions. [2019-10-13 23:21:55,773 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 768 transitions. Word has length 49 [2019-10-13 23:21:55,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:55,774 INFO L462 AbstractCegarLoop]: Abstraction has 605 states and 768 transitions. [2019-10-13 23:21:55,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:55,774 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 768 transitions. [2019-10-13 23:21:55,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:21:55,775 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:55,775 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] [2019-10-13 23:21:55,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:55,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:55,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1324463465, now seen corresponding path program 1 times [2019-10-13 23:21:55,776 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:55,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289654728] [2019-10-13 23:21:55,776 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:55,777 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:55,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:55,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:55,818 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289654728] [2019-10-13 23:21:55,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:55,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:55,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142650440] [2019-10-13 23:21:55,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:55,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:55,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:55,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:55,820 INFO L87 Difference]: Start difference. First operand 605 states and 768 transitions. Second operand 3 states. [2019-10-13 23:21:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:55,974 INFO L93 Difference]: Finished difference Result 1285 states and 1682 transitions. [2019-10-13 23:21:55,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:55,975 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-10-13 23:21:55,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:55,980 INFO L225 Difference]: With dead ends: 1285 [2019-10-13 23:21:55,980 INFO L226 Difference]: Without dead ends: 888 [2019-10-13 23:21:55,982 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2019-10-13 23:21:56,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 797. [2019-10-13 23:21:56,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-10-13 23:21:56,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1031 transitions. [2019-10-13 23:21:56,071 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1031 transitions. Word has length 50 [2019-10-13 23:21:56,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:56,071 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1031 transitions. [2019-10-13 23:21:56,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:56,071 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1031 transitions. [2019-10-13 23:21:56,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:21:56,072 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:56,073 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] [2019-10-13 23:21:56,073 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:56,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:56,073 INFO L82 PathProgramCache]: Analyzing trace with hash -2023369027, now seen corresponding path program 1 times [2019-10-13 23:21:56,073 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:56,074 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491117495] [2019-10-13 23:21:56,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,074 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:56,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:56,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:56,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:56,323 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491117495] [2019-10-13 23:21:56,324 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:56,324 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:56,324 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452038991] [2019-10-13 23:21:56,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:56,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:56,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:56,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:56,325 INFO L87 Difference]: Start difference. First operand 797 states and 1031 transitions. Second operand 12 states. [2019-10-13 23:21:57,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:57,279 INFO L93 Difference]: Finished difference Result 1504 states and 1974 transitions. [2019-10-13 23:21:57,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-13 23:21:57,279 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-13 23:21:57,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:57,286 INFO L225 Difference]: With dead ends: 1504 [2019-10-13 23:21:57,287 INFO L226 Difference]: Without dead ends: 1361 [2019-10-13 23:21:57,288 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=166, Invalid=340, Unknown=0, NotChecked=0, Total=506 [2019-10-13 23:21:57,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2019-10-13 23:21:57,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 809. [2019-10-13 23:21:57,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 809 states. [2019-10-13 23:21:57,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 809 states to 809 states and 1043 transitions. [2019-10-13 23:21:57,380 INFO L78 Accepts]: Start accepts. Automaton has 809 states and 1043 transitions. Word has length 50 [2019-10-13 23:21:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:57,380 INFO L462 AbstractCegarLoop]: Abstraction has 809 states and 1043 transitions. [2019-10-13 23:21:57,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:57,380 INFO L276 IsEmpty]: Start isEmpty. Operand 809 states and 1043 transitions. [2019-10-13 23:21:57,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-10-13 23:21:57,381 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:57,381 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] [2019-10-13 23:21:57,382 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:57,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:57,382 INFO L82 PathProgramCache]: Analyzing trace with hash 854854237, now seen corresponding path program 1 times [2019-10-13 23:21:57,382 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:57,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142590616] [2019-10-13 23:21:57,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:57,383 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:57,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:57,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:57,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142590616] [2019-10-13 23:21:57,619 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:57,619 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 23:21:57,619 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542667893] [2019-10-13 23:21:57,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 23:21:57,620 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:57,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 23:21:57,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-10-13 23:21:57,620 INFO L87 Difference]: Start difference. First operand 809 states and 1043 transitions. Second operand 12 states. [2019-10-13 23:21:58,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:58,468 INFO L93 Difference]: Finished difference Result 2400 states and 3190 transitions. [2019-10-13 23:21:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-13 23:21:58,469 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 50 [2019-10-13 23:21:58,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:58,481 INFO L225 Difference]: With dead ends: 2400 [2019-10-13 23:21:58,481 INFO L226 Difference]: Without dead ends: 1894 [2019-10-13 23:21:58,483 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=252, Unknown=0, NotChecked=0, Total=380 [2019-10-13 23:21:58,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1894 states. [2019-10-13 23:21:58,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1894 to 1333. [2019-10-13 23:21:58,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1333 states. [2019-10-13 23:21:58,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1333 states to 1333 states and 1749 transitions. [2019-10-13 23:21:58,628 INFO L78 Accepts]: Start accepts. Automaton has 1333 states and 1749 transitions. Word has length 50 [2019-10-13 23:21:58,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:58,628 INFO L462 AbstractCegarLoop]: Abstraction has 1333 states and 1749 transitions. [2019-10-13 23:21:58,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 23:21:58,628 INFO L276 IsEmpty]: Start isEmpty. Operand 1333 states and 1749 transitions. [2019-10-13 23:21:58,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-10-13 23:21:58,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:58,630 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-13 23:21:58,630 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:58,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:58,630 INFO L82 PathProgramCache]: Analyzing trace with hash -533267837, now seen corresponding path program 1 times [2019-10-13 23:21:58,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:58,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500662323] [2019-10-13 23:21:58,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:58,631 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:58,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:58,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:58,675 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500662323] [2019-10-13 23:21:58,675 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:58,675 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:21:58,676 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265709857] [2019-10-13 23:21:58,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:21:58,676 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:21:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:58,677 INFO L87 Difference]: Start difference. First operand 1333 states and 1749 transitions. Second operand 3 states. [2019-10-13 23:21:58,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:58,921 INFO L93 Difference]: Finished difference Result 3106 states and 4159 transitions. [2019-10-13 23:21:58,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:21:58,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-10-13 23:21:58,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:58,931 INFO L225 Difference]: With dead ends: 3106 [2019-10-13 23:21:58,931 INFO L226 Difference]: Without dead ends: 2011 [2019-10-13 23:21:58,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:21:58,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-10-13 23:21:59,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 2007. [2019-10-13 23:21:59,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-10-13 23:21:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 2669 transitions. [2019-10-13 23:21:59,151 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 2669 transitions. Word has length 51 [2019-10-13 23:21:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:59,152 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 2669 transitions. [2019-10-13 23:21:59,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:21:59,152 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 2669 transitions. [2019-10-13 23:21:59,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-10-13 23:21:59,153 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:59,153 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:59,153 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:59,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:59,154 INFO L82 PathProgramCache]: Analyzing trace with hash 446459698, now seen corresponding path program 1 times [2019-10-13 23:21:59,154 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:59,154 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140859742] [2019-10-13 23:21:59,154 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,155 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:59,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:59,971 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-13 23:22:00,090 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 40 [2019-10-13 23:22:00,585 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-13 23:22:00,719 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 49 [2019-10-13 23:22:00,876 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2019-10-13 23:22:01,033 WARN L191 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-10-13 23:22:01,216 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-13 23:22:01,364 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 62 [2019-10-13 23:22:01,532 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 67 [2019-10-13 23:22:01,779 WARN L191 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2019-10-13 23:22:02,360 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:02,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140859742] [2019-10-13 23:22:02,361 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:02,361 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2019-10-13 23:22:02,361 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205112211] [2019-10-13 23:22:02,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-13 23:22:02,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:02,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-13 23:22:02,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=563, Unknown=0, NotChecked=0, Total=650 [2019-10-13 23:22:02,362 INFO L87 Difference]: Start difference. First operand 2007 states and 2669 transitions. Second operand 26 states. [2019-10-13 23:22:02,546 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-13 23:22:03,036 WARN L191 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 43 [2019-10-13 23:22:03,209 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 47 [2019-10-13 23:22:03,378 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-13 23:22:03,561 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2019-10-13 23:22:03,818 WARN L191 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-10-13 23:22:04,050 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2019-10-13 23:22:04,320 WARN L191 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 66 [2019-10-13 23:22:04,693 WARN L191 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2019-10-13 23:22:05,208 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 92 [2019-10-13 23:22:05,650 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 99 [2019-10-13 23:22:06,115 WARN L191 SmtUtils]: Spent 388.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 104 [2019-10-13 23:22:06,741 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 109 [2019-10-13 23:22:07,380 WARN L191 SmtUtils]: Spent 534.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 127 [2019-10-13 23:22:08,043 WARN L191 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 135 [2019-10-13 23:22:08,461 WARN L191 SmtUtils]: Spent 315.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 93 [2019-10-13 23:22:09,157 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 46 [2019-10-13 23:22:10,930 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 50 [2019-10-13 23:22:11,610 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2019-10-13 23:22:12,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:12,815 INFO L93 Difference]: Finished difference Result 5645 states and 7571 transitions. [2019-10-13 23:22:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-13 23:22:12,815 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 52 [2019-10-13 23:22:12,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:12,836 INFO L225 Difference]: With dead ends: 5645 [2019-10-13 23:22:12,836 INFO L226 Difference]: Without dead ends: 5373 [2019-10-13 23:22:12,839 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 458 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=599, Invalid=1753, Unknown=0, NotChecked=0, Total=2352 [2019-10-13 23:22:12,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5373 states. [2019-10-13 23:22:13,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5373 to 1995. [2019-10-13 23:22:13,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1995 states. [2019-10-13 23:22:13,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1995 states to 1995 states and 2656 transitions. [2019-10-13 23:22:13,247 INFO L78 Accepts]: Start accepts. Automaton has 1995 states and 2656 transitions. Word has length 52 [2019-10-13 23:22:13,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:13,247 INFO L462 AbstractCegarLoop]: Abstraction has 1995 states and 2656 transitions. [2019-10-13 23:22:13,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-13 23:22:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1995 states and 2656 transitions. [2019-10-13 23:22:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-13 23:22:13,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:13,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:22:13,249 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:13,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1542380715, now seen corresponding path program 1 times [2019-10-13 23:22:13,250 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:13,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506932970] [2019-10-13 23:22:13,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,251 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:13,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:13,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:13,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506932970] [2019-10-13 23:22:13,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:13,328 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:13,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932126850] [2019-10-13 23:22:13,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:13,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:13,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:13,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:13,329 INFO L87 Difference]: Start difference. First operand 1995 states and 2656 transitions. Second operand 3 states. [2019-10-13 23:22:13,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:13,653 INFO L93 Difference]: Finished difference Result 3998 states and 5329 transitions. [2019-10-13 23:22:13,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:13,653 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-13 23:22:13,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:13,663 INFO L225 Difference]: With dead ends: 3998 [2019-10-13 23:22:13,664 INFO L226 Difference]: Without dead ends: 2518 [2019-10-13 23:22:13,667 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:13,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2518 states. [2019-10-13 23:22:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2518 to 2296. [2019-10-13 23:22:13,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2296 states. [2019-10-13 23:22:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2296 states to 2296 states and 3031 transitions. [2019-10-13 23:22:13,981 INFO L78 Accepts]: Start accepts. Automaton has 2296 states and 3031 transitions. Word has length 55 [2019-10-13 23:22:13,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:13,981 INFO L462 AbstractCegarLoop]: Abstraction has 2296 states and 3031 transitions. [2019-10-13 23:22:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 2296 states and 3031 transitions. [2019-10-13 23:22:13,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-10-13 23:22:13,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:13,983 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-13 23:22:13,984 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:13,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:13,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1558584849, now seen corresponding path program 1 times [2019-10-13 23:22:13,984 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:13,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163219177] [2019-10-13 23:22:13,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:13,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:14,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:14,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:14,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163219177] [2019-10-13 23:22:14,034 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:14,034 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:14,034 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780879125] [2019-10-13 23:22:14,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:14,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:14,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:14,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:14,035 INFO L87 Difference]: Start difference. First operand 2296 states and 3031 transitions. Second operand 3 states. [2019-10-13 23:22:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:14,394 INFO L93 Difference]: Finished difference Result 3968 states and 5247 transitions. [2019-10-13 23:22:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:14,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-10-13 23:22:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:14,403 INFO L225 Difference]: With dead ends: 3968 [2019-10-13 23:22:14,403 INFO L226 Difference]: Without dead ends: 2735 [2019-10-13 23:22:14,406 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:14,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2735 states. [2019-10-13 23:22:14,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2735 to 2553. [2019-10-13 23:22:14,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2553 states. [2019-10-13 23:22:14,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2553 states to 2553 states and 3356 transitions. [2019-10-13 23:22:14,719 INFO L78 Accepts]: Start accepts. Automaton has 2553 states and 3356 transitions. Word has length 58 [2019-10-13 23:22:14,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:14,719 INFO L462 AbstractCegarLoop]: Abstraction has 2553 states and 3356 transitions. [2019-10-13 23:22:14,719 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:14,719 INFO L276 IsEmpty]: Start isEmpty. Operand 2553 states and 3356 transitions. [2019-10-13 23:22:14,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-10-13 23:22:14,720 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:14,721 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-13 23:22:14,721 INFO L410 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:14,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:14,721 INFO L82 PathProgramCache]: Analyzing trace with hash -895213973, now seen corresponding path program 1 times [2019-10-13 23:22:14,722 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:14,722 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735954108] [2019-10-13 23:22:14,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:14,722 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:14,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:14,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:14,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:14,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735954108] [2019-10-13 23:22:14,782 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:14,782 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 23:22:14,782 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539286858] [2019-10-13 23:22:14,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 23:22:14,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:14,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 23:22:14,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:14,784 INFO L87 Difference]: Start difference. First operand 2553 states and 3356 transitions. Second operand 3 states. [2019-10-13 23:22:15,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:15,230 INFO L93 Difference]: Finished difference Result 5056 states and 6654 transitions. [2019-10-13 23:22:15,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 23:22:15,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-10-13 23:22:15,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:15,242 INFO L225 Difference]: With dead ends: 5056 [2019-10-13 23:22:15,242 INFO L226 Difference]: Without dead ends: 3570 [2019-10-13 23:22:15,245 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 23:22:15,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3570 states. [2019-10-13 23:22:15,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3570 to 3346. [2019-10-13 23:22:15,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3346 states. [2019-10-13 23:22:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3346 states to 3346 states and 4348 transitions. [2019-10-13 23:22:15,692 INFO L78 Accepts]: Start accepts. Automaton has 3346 states and 4348 transitions. Word has length 62 [2019-10-13 23:22:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:15,693 INFO L462 AbstractCegarLoop]: Abstraction has 3346 states and 4348 transitions. [2019-10-13 23:22:15,693 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 23:22:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 3346 states and 4348 transitions. [2019-10-13 23:22:15,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-13 23:22:15,694 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:15,695 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] [2019-10-13 23:22:15,695 INFO L410 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:15,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:15,695 INFO L82 PathProgramCache]: Analyzing trace with hash 2069297178, now seen corresponding path program 1 times [2019-10-13 23:22:15,696 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:15,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985086856] [2019-10-13 23:22:15,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,696 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:15,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:15,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:15,792 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985086856] [2019-10-13 23:22:15,792 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:22:15,792 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:22:15,792 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143401613] [2019-10-13 23:22:15,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:22:15,793 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:22:15,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:22:15,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:22:15,794 INFO L87 Difference]: Start difference. First operand 3346 states and 4348 transitions. Second operand 7 states. [2019-10-13 23:22:16,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:22:16,436 INFO L93 Difference]: Finished difference Result 4712 states and 6067 transitions. [2019-10-13 23:22:16,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-13 23:22:16,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-10-13 23:22:16,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:22:16,460 INFO L225 Difference]: With dead ends: 4712 [2019-10-13 23:22:16,460 INFO L226 Difference]: Without dead ends: 4710 [2019-10-13 23:22:16,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-10-13 23:22:16,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4710 states. [2019-10-13 23:22:17,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4710 to 3961. [2019-10-13 23:22:17,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3961 states. [2019-10-13 23:22:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3961 states to 3961 states and 5110 transitions. [2019-10-13 23:22:17,013 INFO L78 Accepts]: Start accepts. Automaton has 3961 states and 5110 transitions. Word has length 65 [2019-10-13 23:22:17,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:22:17,013 INFO L462 AbstractCegarLoop]: Abstraction has 3961 states and 5110 transitions. [2019-10-13 23:22:17,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:22:17,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3961 states and 5110 transitions. [2019-10-13 23:22:17,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-10-13 23:22:17,016 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:22:17,016 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1] [2019-10-13 23:22:17,016 INFO L410 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:22:17,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:22:17,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1412306678, now seen corresponding path program 1 times [2019-10-13 23:22:17,017 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:22:17,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995645359] [2019-10-13 23:22:17,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:17,017 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:22:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:22:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:17,650 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:17,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995645359] [2019-10-13 23:22:17,650 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1878757652] [2019-10-13 23:22:17,651 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-13 23:22:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:22:17,809 INFO L256 TraceCheckSpWp]: Trace formula consists of 635 conjuncts, 55 conjunts are in the unsatisfiable core [2019-10-13 23:22:17,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 23:22:18,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,271 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,276 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,452 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,461 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:18,544 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 23:22:18,568 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,630 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,644 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:18,777 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,781 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,782 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,786 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,788 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,792 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,793 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,799 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:18,800 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,051 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 35 [2019-10-13 23:22:19,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 23:22:19,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,058 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,061 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,064 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,079 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,080 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,082 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 4 terms [2019-10-13 23:22:19,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,083 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,084 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,086 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,091 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:19,092 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,094 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,097 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,100 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,101 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,104 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,106 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,109 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:19,765 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 61 [2019-10-13 23:22:20,187 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 55 [2019-10-13 23:22:20,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 5 terms [2019-10-13 23:22:20,190 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 23:22:20,431 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 23:22:20,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:22:20,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1522258164] [2019-10-13 23:22:20,613 INFO L162 IcfgInterpreter]: Started Sifa with 67 locations of interest [2019-10-13 23:22:20,614 INFO L169 IcfgInterpreter]: Building call graph [2019-10-13 23:22:20,619 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-13 23:22:20,627 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-13 23:22:20,628 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-13 23:22:21,253 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 172 for LOIs [2019-10-13 23:22:21,456 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 262