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_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 23:21:26,234 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 23:21:26,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 23:21:26,257 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 23:21:26,258 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 23:21:26,260 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 23:21:26,262 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 23:21:26,273 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 23:21:26,278 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 23:21:26,280 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 23:21:26,282 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 23:21:26,284 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 23:21:26,285 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 23:21:26,287 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 23:21:26,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 23:21:26,290 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 23:21:26,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 23:21:26,293 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 23:21:26,294 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 23:21:26,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 23:21:26,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 23:21:26,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 23:21:26,309 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 23:21:26,310 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 23:21:26,312 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 23:21:26,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 23:21:26,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 23:21:26,314 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 23:21:26,315 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 23:21:26,316 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 23:21:26,316 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 23:21:26,318 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 23:21:26,319 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 23:21:26,319 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 23:21:26,321 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 23:21:26,321 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 23:21:26,322 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 23:21:26,322 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 23:21:26,322 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 23:21:26,323 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 23:21:26,324 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 23:21:26,325 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:26,357 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 23:21:26,358 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 23:21:26,362 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 23:21:26,362 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 23:21:26,363 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 23:21:26,363 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 23:21:26,363 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 23:21:26,363 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 23:21:26,364 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 23:21:26,364 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 23:21:26,364 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 23:21:26,366 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 23:21:26,366 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 23:21:26,367 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 23:21:26,367 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 23:21:26,367 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 23:21:26,367 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 23:21:26,367 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 23:21:26,368 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 23:21:26,368 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 23:21:26,368 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 23:21:26,368 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 23:21:26,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 23:21:26,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 23:21:26,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 23:21:26,370 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 23:21:26,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 23:21:26,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 23:21:26,370 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:26,673 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 23:21:26,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 23:21:26,690 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 23:21:26,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 23:21:26,692 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 23:21:26,692 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:26,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05eee885/06780c78d3df47cd9e6a40a67ab2b6fa/FLAG5d49f6fc4 [2019-10-13 23:21:27,319 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 23:21:27,319 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:27,343 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05eee885/06780c78d3df47cd9e6a40a67ab2b6fa/FLAG5d49f6fc4 [2019-10-13 23:21:27,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05eee885/06780c78d3df47cd9e6a40a67ab2b6fa [2019-10-13 23:21:27,570 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 23:21:27,571 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 23:21:27,576 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:27,576 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 23:21:27,580 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 23:21:27,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:27" (1/1) ... [2019-10-13 23:21:27,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c84b13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:27, skipping insertion in model container [2019-10-13 23:21:27,584 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:21:27" (1/1) ... [2019-10-13 23:21:27,592 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 23:21:27,679 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 23:21:28,363 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:28,394 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 23:21:28,786 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 23:21:28,808 INFO L192 MainTranslator]: Completed translation [2019-10-13 23:21:28,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:28 WrapperNode [2019-10-13 23:21:28,809 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 23:21:28,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 23:21:28,809 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 23:21:28,809 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 23:21:28,821 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:28" (1/1) ... [2019-10-13 23:21:28,821 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:28" (1/1) ... [2019-10-13 23:21:28,840 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:28" (1/1) ... [2019-10-13 23:21:28,841 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:28" (1/1) ... [2019-10-13 23:21:28,872 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:28" (1/1) ... [2019-10-13 23:21:28,898 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:28" (1/1) ... [2019-10-13 23:21:28,904 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:28" (1/1) ... [2019-10-13 23:21:28,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 23:21:28,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 23:21:28,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 23:21:28,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 23:21:28,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:28" (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:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 23:21:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 23:21:29,004 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 23:21:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 23:21:29,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-10-13 23:21:29,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-10-13 23:21:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-10-13 23:21:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-13 23:21:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-10-13 23:21:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-10-13 23:21:29,007 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-10-13 23:21:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-10-13 23:21:29,008 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-10-13 23:21:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-10-13 23:21:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-13 23:21:29,009 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 23:21:29,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 23:21:29,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 23:21:31,708 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 23:21:31,709 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-13 23:21:31,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:31 BoogieIcfgContainer [2019-10-13 23:21:31,711 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 23:21:31,712 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 23:21:31,712 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 23:21:31,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 23:21:31,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:21:27" (1/3) ... [2019-10-13 23:21:31,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a571106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:31, skipping insertion in model container [2019-10-13 23:21:31,719 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:21:28" (2/3) ... [2019-10-13 23:21:31,720 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a571106 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:21:31, skipping insertion in model container [2019-10-13 23:21:31,720 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:21:31" (3/3) ... [2019-10-13 23:21:31,730 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.3.ufo.BOUNDED-6.pals.c.v+lhb-reducer.c [2019-10-13 23:21:31,741 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 23:21:31,758 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 5 error locations. [2019-10-13 23:21:31,770 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-10-13 23:21:31,812 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 23:21:31,812 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 23:21:31,812 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 23:21:31,813 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 23:21:31,813 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 23:21:31,813 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 23:21:31,813 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 23:21:31,813 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 23:21:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states. [2019-10-13 23:21:31,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-13 23:21:31,859 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:31,860 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:31,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:31,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:31,868 INFO L82 PathProgramCache]: Analyzing trace with hash 2122019626, now seen corresponding path program 1 times [2019-10-13 23:21:31,877 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:31,878 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360195489] [2019-10-13 23:21:31,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:31,878 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:31,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:32,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:33,325 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:33,326 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360195489] [2019-10-13 23:21:33,327 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:33,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:21:33,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609738457] [2019-10-13 23:21:33,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:21:33,335 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:33,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:21:33,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:33,354 INFO L87 Difference]: Start difference. First operand 292 states. Second operand 7 states. [2019-10-13 23:21:33,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:33,822 INFO L93 Difference]: Finished difference Result 966 states and 1683 transitions. [2019-10-13 23:21:33,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 23:21:33,825 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 118 [2019-10-13 23:21:33,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:33,850 INFO L225 Difference]: With dead ends: 966 [2019-10-13 23:21:33,850 INFO L226 Difference]: Without dead ends: 728 [2019-10-13 23:21:33,858 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:33,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2019-10-13 23:21:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 686. [2019-10-13 23:21:33,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-13 23:21:33,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 895 transitions. [2019-10-13 23:21:33,970 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 895 transitions. Word has length 118 [2019-10-13 23:21:33,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:33,971 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 895 transitions. [2019-10-13 23:21:33,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:21:33,971 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 895 transitions. [2019-10-13 23:21:33,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 23:21:33,979 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:33,979 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:33,980 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:33,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:33,980 INFO L82 PathProgramCache]: Analyzing trace with hash -750036124, now seen corresponding path program 1 times [2019-10-13 23:21:33,980 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:33,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935546915] [2019-10-13 23:21:33,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:33,981 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:33,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:34,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:34,163 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:34,163 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935546915] [2019-10-13 23:21:34,163 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:34,164 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:34,164 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082893401] [2019-10-13 23:21:34,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:34,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:34,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:34,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:34,167 INFO L87 Difference]: Start difference. First operand 686 states and 895 transitions. Second operand 5 states. [2019-10-13 23:21:34,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:34,528 INFO L93 Difference]: Finished difference Result 1281 states and 1671 transitions. [2019-10-13 23:21:34,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:34,529 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-13 23:21:34,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:34,535 INFO L225 Difference]: With dead ends: 1281 [2019-10-13 23:21:34,535 INFO L226 Difference]: Without dead ends: 686 [2019-10-13 23:21:34,542 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:34,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2019-10-13 23:21:34,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2019-10-13 23:21:34,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 686 states. [2019-10-13 23:21:34,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 883 transitions. [2019-10-13 23:21:34,623 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 883 transitions. Word has length 124 [2019-10-13 23:21:34,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:34,626 INFO L462 AbstractCegarLoop]: Abstraction has 686 states and 883 transitions. [2019-10-13 23:21:34,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:34,627 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 883 transitions. [2019-10-13 23:21:34,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 23:21:34,643 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:34,644 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:34,645 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:34,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash 889076878, now seen corresponding path program 1 times [2019-10-13 23:21:34,646 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:34,647 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703743664] [2019-10-13 23:21:34,647 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:34,648 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:34,648 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:34,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:35,468 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:35,471 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703743664] [2019-10-13 23:21:35,472 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:35,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 23:21:35,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344578352] [2019-10-13 23:21:35,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 23:21:35,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:35,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 23:21:35,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:35,477 INFO L87 Difference]: Start difference. First operand 686 states and 883 transitions. Second operand 7 states. [2019-10-13 23:21:35,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:35,846 INFO L93 Difference]: Finished difference Result 2140 states and 2800 transitions. [2019-10-13 23:21:35,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 23:21:35,847 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2019-10-13 23:21:35,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:35,856 INFO L225 Difference]: With dead ends: 2140 [2019-10-13 23:21:35,857 INFO L226 Difference]: Without dead ends: 1590 [2019-10-13 23:21:35,859 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-10-13 23:21:35,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2019-10-13 23:21:35,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1548. [2019-10-13 23:21:35,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-13 23:21:35,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2040 transitions. [2019-10-13 23:21:35,972 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2040 transitions. Word has length 124 [2019-10-13 23:21:35,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:35,974 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2040 transitions. [2019-10-13 23:21:35,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 23:21:35,974 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2040 transitions. [2019-10-13 23:21:35,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 23:21:35,977 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:35,977 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:35,979 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:35,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:35,980 INFO L82 PathProgramCache]: Analyzing trace with hash -477679404, now seen corresponding path program 1 times [2019-10-13 23:21:35,980 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:35,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035424142] [2019-10-13 23:21:35,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:35,980 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:35,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:36,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:36,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:36,199 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035424142] [2019-10-13 23:21:36,199 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:36,199 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:36,199 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423488416] [2019-10-13 23:21:36,201 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:36,201 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:36,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:36,202 INFO L87 Difference]: Start difference. First operand 1548 states and 2040 transitions. Second operand 5 states. [2019-10-13 23:21:36,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:36,504 INFO L93 Difference]: Finished difference Result 3021 states and 3984 transitions. [2019-10-13 23:21:36,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:36,507 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-13 23:21:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:36,515 INFO L225 Difference]: With dead ends: 3021 [2019-10-13 23:21:36,515 INFO L226 Difference]: Without dead ends: 1548 [2019-10-13 23:21:36,518 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:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2019-10-13 23:21:36,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1548. [2019-10-13 23:21:36,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1548 states. [2019-10-13 23:21:36,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1548 states to 1548 states and 2009 transitions. [2019-10-13 23:21:36,614 INFO L78 Accepts]: Start accepts. Automaton has 1548 states and 2009 transitions. Word has length 124 [2019-10-13 23:21:36,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:36,614 INFO L462 AbstractCegarLoop]: Abstraction has 1548 states and 2009 transitions. [2019-10-13 23:21:36,614 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:36,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1548 states and 2009 transitions. [2019-10-13 23:21:36,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-10-13 23:21:36,617 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:36,617 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:36,618 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:36,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:36,618 INFO L82 PathProgramCache]: Analyzing trace with hash 1624067626, now seen corresponding path program 1 times [2019-10-13 23:21:36,619 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:36,619 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694357197] [2019-10-13 23:21:36,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:36,619 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:36,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:36,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:36,997 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:36,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694357197] [2019-10-13 23:21:36,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:36,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:36,999 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289101545] [2019-10-13 23:21:36,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:36,999 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:37,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:37,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:37,000 INFO L87 Difference]: Start difference. First operand 1548 states and 2009 transitions. Second operand 5 states. [2019-10-13 23:21:37,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:37,178 INFO L93 Difference]: Finished difference Result 2533 states and 3343 transitions. [2019-10-13 23:21:37,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:37,179 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 124 [2019-10-13 23:21:37,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:37,189 INFO L225 Difference]: With dead ends: 2533 [2019-10-13 23:21:37,189 INFO L226 Difference]: Without dead ends: 1791 [2019-10-13 23:21:37,192 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:37,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2019-10-13 23:21:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1500. [2019-10-13 23:21:37,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1500 states. [2019-10-13 23:21:37,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1500 states to 1500 states and 1929 transitions. [2019-10-13 23:21:37,318 INFO L78 Accepts]: Start accepts. Automaton has 1500 states and 1929 transitions. Word has length 124 [2019-10-13 23:21:37,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:37,318 INFO L462 AbstractCegarLoop]: Abstraction has 1500 states and 1929 transitions. [2019-10-13 23:21:37,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:37,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1500 states and 1929 transitions. [2019-10-13 23:21:37,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:21:37,321 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:37,322 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:37,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:37,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:37,322 INFO L82 PathProgramCache]: Analyzing trace with hash -788819286, now seen corresponding path program 1 times [2019-10-13 23:21:37,323 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:37,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189864223] [2019-10-13 23:21:37,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:37,323 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:37,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:37,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:37,694 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189864223] [2019-10-13 23:21:37,695 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:37,695 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:37,695 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269620938] [2019-10-13 23:21:37,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:37,696 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:37,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:37,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:37,696 INFO L87 Difference]: Start difference. First operand 1500 states and 1929 transitions. Second operand 5 states. [2019-10-13 23:21:38,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:38,038 INFO L93 Difference]: Finished difference Result 2317 states and 2974 transitions. [2019-10-13 23:21:38,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:38,039 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 23:21:38,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:38,052 INFO L225 Difference]: With dead ends: 2317 [2019-10-13 23:21:38,052 INFO L226 Difference]: Without dead ends: 1765 [2019-10-13 23:21:38,058 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:38,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1765 states. [2019-10-13 23:21:38,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1765 to 1636. [2019-10-13 23:21:38,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1636 states. [2019-10-13 23:21:38,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1636 states to 1636 states and 2077 transitions. [2019-10-13 23:21:38,227 INFO L78 Accepts]: Start accepts. Automaton has 1636 states and 2077 transitions. Word has length 130 [2019-10-13 23:21:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:38,229 INFO L462 AbstractCegarLoop]: Abstraction has 1636 states and 2077 transitions. [2019-10-13 23:21:38,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1636 states and 2077 transitions. [2019-10-13 23:21:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-10-13 23:21:38,234 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:38,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:38,235 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:38,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:38,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1869731908, now seen corresponding path program 1 times [2019-10-13 23:21:38,236 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:38,237 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842237896] [2019-10-13 23:21:38,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:38,237 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:38,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:38,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:38,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 23:21:38,611 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842237896] [2019-10-13 23:21:38,611 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:38,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:38,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461188299] [2019-10-13 23:21:38,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:38,612 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:38,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:38,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:38,613 INFO L87 Difference]: Start difference. First operand 1636 states and 2077 transitions. Second operand 5 states. [2019-10-13 23:21:38,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:38,803 INFO L93 Difference]: Finished difference Result 3154 states and 4087 transitions. [2019-10-13 23:21:38,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:38,803 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-10-13 23:21:38,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:38,812 INFO L225 Difference]: With dead ends: 3154 [2019-10-13 23:21:38,812 INFO L226 Difference]: Without dead ends: 1889 [2019-10-13 23:21:38,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:38,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-10-13 23:21:38,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1664. [2019-10-13 23:21:38,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1664 states. [2019-10-13 23:21:38,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1664 states to 1664 states and 2109 transitions. [2019-10-13 23:21:38,981 INFO L78 Accepts]: Start accepts. Automaton has 1664 states and 2109 transitions. Word has length 130 [2019-10-13 23:21:38,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:38,981 INFO L462 AbstractCegarLoop]: Abstraction has 1664 states and 2109 transitions. [2019-10-13 23:21:38,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:38,981 INFO L276 IsEmpty]: Start isEmpty. Operand 1664 states and 2109 transitions. [2019-10-13 23:21:38,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 23:21:38,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:38,985 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:38,985 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:38,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:38,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1348043834, now seen corresponding path program 1 times [2019-10-13 23:21:38,986 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:38,986 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596113778] [2019-10-13 23:21:38,986 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:38,987 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:38,987 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:39,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:39,436 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:39,437 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596113778] [2019-10-13 23:21:39,437 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:39,437 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:39,437 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763446079] [2019-10-13 23:21:39,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:39,438 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:39,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:39,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:39,439 INFO L87 Difference]: Start difference. First operand 1664 states and 2109 transitions. Second operand 5 states. [2019-10-13 23:21:39,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:39,668 INFO L93 Difference]: Finished difference Result 3144 states and 3975 transitions. [2019-10-13 23:21:39,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:39,669 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-13 23:21:39,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:39,679 INFO L225 Difference]: With dead ends: 3144 [2019-10-13 23:21:39,680 INFO L226 Difference]: Without dead ends: 2421 [2019-10-13 23:21:39,682 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:39,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-10-13 23:21:39,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2400. [2019-10-13 23:21:39,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-10-13 23:21:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 3022 transitions. [2019-10-13 23:21:39,931 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 3022 transitions. Word has length 136 [2019-10-13 23:21:39,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:39,931 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 3022 transitions. [2019-10-13 23:21:39,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 3022 transitions. [2019-10-13 23:21:39,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 23:21:39,935 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:39,936 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:39,936 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:39,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:39,936 INFO L82 PathProgramCache]: Analyzing trace with hash -901341700, now seen corresponding path program 1 times [2019-10-13 23:21:39,937 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:39,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241462819] [2019-10-13 23:21:39,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:39,937 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:39,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:39,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:40,079 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:40,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241462819] [2019-10-13 23:21:40,080 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:40,081 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:40,081 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719060961] [2019-10-13 23:21:40,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:40,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:40,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:40,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:40,082 INFO L87 Difference]: Start difference. First operand 2400 states and 3022 transitions. Second operand 5 states. [2019-10-13 23:21:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:40,480 INFO L93 Difference]: Finished difference Result 4758 states and 5997 transitions. [2019-10-13 23:21:40,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:40,480 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-13 23:21:40,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:40,491 INFO L225 Difference]: With dead ends: 4758 [2019-10-13 23:21:40,491 INFO L226 Difference]: Without dead ends: 2400 [2019-10-13 23:21:40,496 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:40,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2400 states. [2019-10-13 23:21:40,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2400 to 2400. [2019-10-13 23:21:40,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2400 states. [2019-10-13 23:21:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2400 states to 2400 states and 2979 transitions. [2019-10-13 23:21:40,680 INFO L78 Accepts]: Start accepts. Automaton has 2400 states and 2979 transitions. Word has length 136 [2019-10-13 23:21:40,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:40,680 INFO L462 AbstractCegarLoop]: Abstraction has 2400 states and 2979 transitions. [2019-10-13 23:21:40,681 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 2400 states and 2979 transitions. [2019-10-13 23:21:40,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 23:21:40,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:40,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:40,686 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:40,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:40,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1514093286, now seen corresponding path program 1 times [2019-10-13 23:21:40,687 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:40,687 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459884758] [2019-10-13 23:21:40,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:40,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:40,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:40,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:41,212 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:41,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459884758] [2019-10-13 23:21:41,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:41,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 23:21:41,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500122640] [2019-10-13 23:21:41,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 23:21:41,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:41,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 23:21:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-13 23:21:41,217 INFO L87 Difference]: Start difference. First operand 2400 states and 2979 transitions. Second operand 5 states. [2019-10-13 23:21:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 23:21:41,556 INFO L93 Difference]: Finished difference Result 3104 states and 3853 transitions. [2019-10-13 23:21:41,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 23:21:41,557 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-13 23:21:41,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 23:21:41,567 INFO L225 Difference]: With dead ends: 3104 [2019-10-13 23:21:41,568 INFO L226 Difference]: Without dead ends: 2417 [2019-10-13 23:21:41,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-13 23:21:41,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2019-10-13 23:21:41,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2392. [2019-10-13 23:21:41,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2392 states. [2019-10-13 23:21:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2392 states to 2392 states and 2969 transitions. [2019-10-13 23:21:41,778 INFO L78 Accepts]: Start accepts. Automaton has 2392 states and 2969 transitions. Word has length 136 [2019-10-13 23:21:41,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 23:21:41,779 INFO L462 AbstractCegarLoop]: Abstraction has 2392 states and 2969 transitions. [2019-10-13 23:21:41,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 23:21:41,779 INFO L276 IsEmpty]: Start isEmpty. Operand 2392 states and 2969 transitions. [2019-10-13 23:21:41,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 23:21:41,784 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 23:21:41,784 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 23:21:41,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 23:21:41,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 23:21:41,785 INFO L82 PathProgramCache]: Analyzing trace with hash -58368430, now seen corresponding path program 1 times [2019-10-13 23:21:41,785 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 23:21:41,786 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988208644] [2019-10-13 23:21:41,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:41,786 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 23:21:41,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 23:21:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 23:21:43,200 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2019-10-13 23:21:43,329 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 51 [2019-10-13 23:21:43,535 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 56 [2019-10-13 23:21:43,753 WARN L191 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 60 [2019-10-13 23:21:44,026 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 63 [2019-10-13 23:21:44,208 WARN L191 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2019-10-13 23:21:44,482 WARN L191 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 65 [2019-10-13 23:21:44,743 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 66 [2019-10-13 23:21:45,031 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 68 [2019-10-13 23:21:45,337 WARN L191 SmtUtils]: Spent 258.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 72 [2019-10-13 23:21:45,654 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 70 [2019-10-13 23:21:45,922 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 69 [2019-10-13 23:21:46,226 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 68 [2019-10-13 23:21:46,558 WARN L191 SmtUtils]: Spent 261.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-10-13 23:21:46,852 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 76 [2019-10-13 23:21:47,127 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 77 [2019-10-13 23:21:47,512 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 87 [2019-10-13 23:21:47,773 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 64 [2019-10-13 23:21:47,977 WARN L191 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-10-13 23:21:48,356 WARN L191 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 72 [2019-10-13 23:21:48,592 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 57 [2019-10-13 23:21:48,960 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2019-10-13 23:21:49,230 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-10-13 23:21:49,532 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 72 [2019-10-13 23:21:49,785 WARN L191 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 54 [2019-10-13 23:21:50,645 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,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988208644] [2019-10-13 23:21:50,646 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 23:21:50,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2019-10-13 23:21:50,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807906333] [2019-10-13 23:21:50,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 34 states [2019-10-13 23:21:50,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 23:21:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2019-10-13 23:21:50,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=1013, Unknown=0, NotChecked=0, Total=1122 [2019-10-13 23:21:50,648 INFO L87 Difference]: Start difference. First operand 2392 states and 2969 transitions. Second operand 34 states. [2019-10-13 23:21:51,167 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 81 [2019-10-13 23:21:51,809 WARN L191 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-10-13 23:21:52,137 WARN L191 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2019-10-13 23:21:52,672 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 79 [2019-10-13 23:21:53,188 WARN L191 SmtUtils]: Spent 410.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 74 [2019-10-13 23:21:54,044 WARN L191 SmtUtils]: Spent 433.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 82 [2019-10-13 23:21:54,777 WARN L191 SmtUtils]: Spent 444.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 84 [2019-10-13 23:21:55,329 WARN L191 SmtUtils]: Spent 448.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 88 [2019-10-13 23:21:55,996 WARN L191 SmtUtils]: Spent 400.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 82 [2019-10-13 23:21:56,505 WARN L191 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 79 [2019-10-13 23:21:57,093 WARN L191 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 89 [2019-10-13 23:21:57,797 WARN L191 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 108 [2019-10-13 23:21:58,453 WARN L191 SmtUtils]: Spent 435.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 100 [2019-10-13 23:21:58,857 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 89 [2019-10-13 23:22:00,162 WARN L191 SmtUtils]: Spent 970.00 ms on a formula simplification. DAG size of input: 249 DAG size of output: 152 [2019-10-13 23:22:01,172 WARN L191 SmtUtils]: Spent 682.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2019-10-13 23:22:01,576 WARN L191 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2019-10-13 23:22:02,549 WARN L191 SmtUtils]: Spent 842.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 140 [2019-10-13 23:22:03,727 WARN L191 SmtUtils]: Spent 773.00 ms on a formula simplification. DAG size of input: 196 DAG size of output: 133 [2019-10-13 23:22:04,310 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106