/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 04:42:44,141 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 04:42:44,145 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 04:42:44,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 04:42:44,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 04:42:44,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 04:42:44,168 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 04:42:44,179 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 04:42:44,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 04:42:44,186 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 04:42:44,187 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 04:42:44,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 04:42:44,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 04:42:44,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 04:42:44,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 04:42:44,195 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 04:42:44,196 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 04:42:44,198 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 04:42:44,199 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 04:42:44,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 04:42:44,208 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 04:42:44,211 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 04:42:44,214 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 04:42:44,215 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 04:42:44,218 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 04:42:44,218 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 04:42:44,218 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 04:42:44,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 04:42:44,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 04:42:44,223 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 04:42:44,223 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 04:42:44,225 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 04:42:44,227 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 04:42:44,227 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 04:42:44,229 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 04:42:44,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 04:42:44,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 04:42:44,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 04:42:44,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 04:42:44,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 04:42:44,231 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 04:42:44,232 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-11-07 04:42:44,262 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 04:42:44,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 04:42:44,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 04:42:44,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 04:42:44,264 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 04:42:44,264 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 04:42:44,264 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 04:42:44,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 04:42:44,265 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 04:42:44,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 04:42:44,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 04:42:44,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 04:42:44,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 04:42:44,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 04:42:44,267 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 04:42:44,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 04:42:44,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 04:42:44,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 04:42:44,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 04:42:44,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 04:42:44,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 04:42:44,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 04:42:44,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 04:42:44,268 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-11-07 04:42:44,549 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 04:42:44,562 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 04:42:44,565 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 04:42:44,567 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 04:42:44,567 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 04:42:44,568 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 04:42:44,648 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a83ea54/e163de055b92499dbc708ef36d539b20/FLAG09ed115f4 [2019-11-07 04:42:45,223 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 04:42:45,224 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 04:42:45,251 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a83ea54/e163de055b92499dbc708ef36d539b20/FLAG09ed115f4 [2019-11-07 04:42:45,534 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0a83ea54/e163de055b92499dbc708ef36d539b20 [2019-11-07 04:42:45,558 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 04:42:45,563 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 04:42:45,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:45,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 04:42:45,576 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 04:42:45,577 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:45" (1/1) ... [2019-11-07 04:42:45,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12886b1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:45, skipping insertion in model container [2019-11-07 04:42:45,587 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 04:42:45" (1/1) ... [2019-11-07 04:42:45,606 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 04:42:45,761 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 04:42:46,452 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:46,465 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 04:42:46,647 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 04:42:46,668 INFO L192 MainTranslator]: Completed translation [2019-11-07 04:42:46,668 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46 WrapperNode [2019-11-07 04:42:46,668 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 04:42:46,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 04:42:46,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 04:42:46,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 04:42:46,680 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,696 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,696 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (1/1) ... [2019-11-07 04:42:46,756 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 04:42:46,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 04:42:46,757 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 04:42:46,757 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 04:42:46,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (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-11-07 04:42:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 04:42:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 04:42:46,843 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 04:42:46,843 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 04:42:46,844 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-11-07 04:42:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-11-07 04:42:46,845 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-11-07 04:42:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-07 04:42:46,846 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-11-07 04:42:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-11-07 04:42:46,847 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-11-07 04:42:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-11-07 04:42:46,848 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-11-07 04:42:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-11-07 04:42:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-07 04:42:46,849 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 04:42:46,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 04:42:46,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 04:42:49,232 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 04:42:49,233 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-07 04:42:49,235 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:49 BoogieIcfgContainer [2019-11-07 04:42:49,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 04:42:49,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 04:42:49,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 04:42:49,240 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 04:42:49,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 04:42:45" (1/3) ... [2019-11-07 04:42:49,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f8dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:49, skipping insertion in model container [2019-11-07 04:42:49,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 04:42:46" (2/3) ... [2019-11-07 04:42:49,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44f8dd05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 04:42:49, skipping insertion in model container [2019-11-07 04:42:49,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 04:42:49" (3/3) ... [2019-11-07 04:42:49,256 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_opt-floodmax.3.3.ufo.BOUNDED-6.pals.c.v+nlh-reducer.c [2019-11-07 04:42:49,268 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 04:42:49,279 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 04:42:49,290 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 04:42:49,322 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 04:42:49,323 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 04:42:49,323 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 04:42:49,323 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 04:42:49,323 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 04:42:49,323 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 04:42:49,323 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 04:42:49,324 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 04:42:49,346 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states. [2019-11-07 04:42:49,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-07 04:42:49,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:49,361 INFO L410 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] [2019-11-07 04:42:49,363 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:49,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:49,368 INFO L82 PathProgramCache]: Analyzing trace with hash -1725767074, now seen corresponding path program 1 times [2019-11-07 04:42:49,376 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:49,376 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936345900] [2019-11-07 04:42:49,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:50,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:50,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:50,525 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936345900] [2019-11-07 04:42:50,526 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:50,526 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:50,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529731079] [2019-11-07 04:42:50,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:50,536 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:50,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:50,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:50,553 INFO L87 Difference]: Start difference. First operand 255 states. Second operand 5 states. [2019-11-07 04:42:50,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:50,786 INFO L93 Difference]: Finished difference Result 637 states and 1103 transitions. [2019-11-07 04:42:50,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:50,788 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 120 [2019-11-07 04:42:50,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:50,818 INFO L225 Difference]: With dead ends: 637 [2019-11-07 04:42:50,818 INFO L226 Difference]: Without dead ends: 436 [2019-11-07 04:42:50,823 INFO L630 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-11-07 04:42:50,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2019-11-07 04:42:50,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 434. [2019-11-07 04:42:50,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2019-11-07 04:42:50,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 599 transitions. [2019-11-07 04:42:50,906 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 599 transitions. Word has length 120 [2019-11-07 04:42:50,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:50,907 INFO L462 AbstractCegarLoop]: Abstraction has 434 states and 599 transitions. [2019-11-07 04:42:50,907 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:50,907 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 599 transitions. [2019-11-07 04:42:50,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 04:42:50,912 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:50,912 INFO L410 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] [2019-11-07 04:42:50,913 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:50,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:50,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1998448092, now seen corresponding path program 1 times [2019-11-07 04:42:50,913 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:50,914 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20084467] [2019-11-07 04:42:50,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:51,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:51,003 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20084467] [2019-11-07 04:42:51,003 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:51,003 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:51,004 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805517712] [2019-11-07 04:42:51,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:51,006 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:51,006 INFO L87 Difference]: Start difference. First operand 434 states and 599 transitions. Second operand 3 states. [2019-11-07 04:42:51,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:51,098 INFO L93 Difference]: Finished difference Result 1017 states and 1444 transitions. [2019-11-07 04:42:51,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:51,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-07 04:42:51,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:51,103 INFO L225 Difference]: With dead ends: 1017 [2019-11-07 04:42:51,103 INFO L226 Difference]: Without dead ends: 628 [2019-11-07 04:42:51,107 INFO L630 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-11-07 04:42:51,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2019-11-07 04:42:51,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 543. [2019-11-07 04:42:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2019-11-07 04:42:51,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 774 transitions. [2019-11-07 04:42:51,146 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 774 transitions. Word has length 122 [2019-11-07 04:42:51,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:51,147 INFO L462 AbstractCegarLoop]: Abstraction has 543 states and 774 transitions. [2019-11-07 04:42:51,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:51,147 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 774 transitions. [2019-11-07 04:42:51,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-07 04:42:51,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:51,151 INFO L410 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] [2019-11-07 04:42:51,152 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:51,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:51,152 INFO L82 PathProgramCache]: Analyzing trace with hash 534945616, now seen corresponding path program 1 times [2019-11-07 04:42:51,153 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:51,153 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091084900] [2019-11-07 04:42:51,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:51,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:51,317 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091084900] [2019-11-07 04:42:51,318 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:51,318 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:51,318 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692315011] [2019-11-07 04:42:51,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:51,320 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:51,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:51,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:51,324 INFO L87 Difference]: Start difference. First operand 543 states and 774 transitions. Second operand 3 states. [2019-11-07 04:42:51,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:51,433 INFO L93 Difference]: Finished difference Result 1286 states and 1883 transitions. [2019-11-07 04:42:51,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:51,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-07 04:42:51,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:51,441 INFO L225 Difference]: With dead ends: 1286 [2019-11-07 04:42:51,442 INFO L226 Difference]: Without dead ends: 812 [2019-11-07 04:42:51,449 INFO L630 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-11-07 04:42:51,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2019-11-07 04:42:51,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 748. [2019-11-07 04:42:51,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 748 states. [2019-11-07 04:42:51,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1103 transitions. [2019-11-07 04:42:51,495 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1103 transitions. Word has length 122 [2019-11-07 04:42:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:51,497 INFO L462 AbstractCegarLoop]: Abstraction has 748 states and 1103 transitions. [2019-11-07 04:42:51,497 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1103 transitions. [2019-11-07 04:42:51,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:42:51,502 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:51,503 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:51,503 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:51,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:51,503 INFO L82 PathProgramCache]: Analyzing trace with hash 220152516, now seen corresponding path program 1 times [2019-11-07 04:42:51,504 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:51,504 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161376473] [2019-11-07 04:42:51,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:51,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:51,644 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161376473] [2019-11-07 04:42:51,645 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:51,645 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:51,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994291788] [2019-11-07 04:42:51,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:51,647 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:51,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:51,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:51,647 INFO L87 Difference]: Start difference. First operand 748 states and 1103 transitions. Second operand 3 states. [2019-11-07 04:42:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:51,755 INFO L93 Difference]: Finished difference Result 1365 states and 2038 transitions. [2019-11-07 04:42:51,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:51,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-11-07 04:42:51,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:51,767 INFO L225 Difference]: With dead ends: 1365 [2019-11-07 04:42:51,767 INFO L226 Difference]: Without dead ends: 1081 [2019-11-07 04:42:51,768 INFO L630 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-11-07 04:42:51,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states. [2019-11-07 04:42:51,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1079. [2019-11-07 04:42:51,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-07 04:42:51,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1587 transitions. [2019-11-07 04:42:51,855 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1587 transitions. Word has length 125 [2019-11-07 04:42:51,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:51,856 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1587 transitions. [2019-11-07 04:42:51,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:51,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1587 transitions. [2019-11-07 04:42:51,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:42:51,860 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:51,860 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:51,861 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:51,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:51,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1458354592, now seen corresponding path program 1 times [2019-11-07 04:42:51,862 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:51,863 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763109764] [2019-11-07 04:42:51,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:52,242 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763109764] [2019-11-07 04:42:52,242 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:52,243 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:52,243 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007379548] [2019-11-07 04:42:52,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:52,244 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:52,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:52,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:52,246 INFO L87 Difference]: Start difference. First operand 1079 states and 1587 transitions. Second operand 5 states. [2019-11-07 04:42:52,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:52,510 INFO L93 Difference]: Finished difference Result 2115 states and 3128 transitions. [2019-11-07 04:42:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:52,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-11-07 04:42:52,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:52,517 INFO L225 Difference]: With dead ends: 2115 [2019-11-07 04:42:52,517 INFO L226 Difference]: Without dead ends: 1079 [2019-11-07 04:42:52,520 INFO L630 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-11-07 04:42:52,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-07 04:42:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1079. [2019-11-07 04:42:52,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1079 states. [2019-11-07 04:42:52,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1079 states to 1079 states and 1570 transitions. [2019-11-07 04:42:52,586 INFO L78 Accepts]: Start accepts. Automaton has 1079 states and 1570 transitions. Word has length 125 [2019-11-07 04:42:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:52,586 INFO L462 AbstractCegarLoop]: Abstraction has 1079 states and 1570 transitions. [2019-11-07 04:42:52,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:52,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1570 transitions. [2019-11-07 04:42:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-11-07 04:42:52,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:52,589 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 04:42:52,589 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:52,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:52,590 INFO L82 PathProgramCache]: Analyzing trace with hash -2129906597, now seen corresponding path program 1 times [2019-11-07 04:42:52,590 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:52,590 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835865221] [2019-11-07 04:42:52,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:52,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:52,941 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835865221] [2019-11-07 04:42:52,942 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:52,943 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:52,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239351087] [2019-11-07 04:42:52,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:52,944 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:52,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:52,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:52,944 INFO L87 Difference]: Start difference. First operand 1079 states and 1570 transitions. Second operand 5 states. [2019-11-07 04:42:53,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:53,193 INFO L93 Difference]: Finished difference Result 2970 states and 4352 transitions. [2019-11-07 04:42:53,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:53,194 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 125 [2019-11-07 04:42:53,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:53,205 INFO L225 Difference]: With dead ends: 2970 [2019-11-07 04:42:53,206 INFO L226 Difference]: Without dead ends: 1999 [2019-11-07 04:42:53,208 INFO L630 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-11-07 04:42:53,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1999 states. [2019-11-07 04:42:53,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1999 to 1997. [2019-11-07 04:42:53,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1997 states. [2019-11-07 04:42:53,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1997 states to 1997 states and 2898 transitions. [2019-11-07 04:42:53,340 INFO L78 Accepts]: Start accepts. Automaton has 1997 states and 2898 transitions. Word has length 125 [2019-11-07 04:42:53,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:53,344 INFO L462 AbstractCegarLoop]: Abstraction has 1997 states and 2898 transitions. [2019-11-07 04:42:53,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 1997 states and 2898 transitions. [2019-11-07 04:42:53,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-11-07 04:42:53,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:53,348 INFO L410 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] [2019-11-07 04:42:53,348 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:53,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:53,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1808965899, now seen corresponding path program 1 times [2019-11-07 04:42:53,349 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:53,352 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894324919] [2019-11-07 04:42:53,353 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:53,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:53,448 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894324919] [2019-11-07 04:42:53,448 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:53,448 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-07 04:42:53,449 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726340353] [2019-11-07 04:42:53,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-07 04:42:53,449 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:53,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-07 04:42:53,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-07 04:42:53,450 INFO L87 Difference]: Start difference. First operand 1997 states and 2898 transitions. Second operand 3 states. [2019-11-07 04:42:53,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:53,754 INFO L93 Difference]: Finished difference Result 5028 states and 7435 transitions. [2019-11-07 04:42:53,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-07 04:42:53,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-11-07 04:42:53,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:53,772 INFO L225 Difference]: With dead ends: 5028 [2019-11-07 04:42:53,773 INFO L226 Difference]: Without dead ends: 3181 [2019-11-07 04:42:53,780 INFO L630 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-11-07 04:42:53,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3181 states. [2019-11-07 04:42:54,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3181 to 3071. [2019-11-07 04:42:54,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-11-07 04:42:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4574 transitions. [2019-11-07 04:42:54,089 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4574 transitions. Word has length 127 [2019-11-07 04:42:54,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,090 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4574 transitions. [2019-11-07 04:42:54,090 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-07 04:42:54,090 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4574 transitions. [2019-11-07 04:42:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:42:54,094 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,094 INFO L410 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-11-07 04:42:54,094 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2023233197, now seen corresponding path program 1 times [2019-11-07 04:42:54,095 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,095 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428821839] [2019-11-07 04:42:54,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:54,258 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:54,258 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428821839] [2019-11-07 04:42:54,259 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:54,259 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:54,259 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809666611] [2019-11-07 04:42:54,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:54,260 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:54,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:54,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:54,260 INFO L87 Difference]: Start difference. First operand 3071 states and 4574 transitions. Second operand 5 states. [2019-11-07 04:42:54,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:54,632 INFO L93 Difference]: Finished difference Result 6004 states and 8972 transitions. [2019-11-07 04:42:54,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:54,632 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 04:42:54,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:54,648 INFO L225 Difference]: With dead ends: 6004 [2019-11-07 04:42:54,649 INFO L226 Difference]: Without dead ends: 3071 [2019-11-07 04:42:54,655 INFO L630 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-11-07 04:42:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states. [2019-11-07 04:42:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 3071. [2019-11-07 04:42:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-11-07 04:42:54,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 4520 transitions. [2019-11-07 04:42:54,903 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 4520 transitions. Word has length 130 [2019-11-07 04:42:54,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:54,903 INFO L462 AbstractCegarLoop]: Abstraction has 3071 states and 4520 transitions. [2019-11-07 04:42:54,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 4520 transitions. [2019-11-07 04:42:54,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:42:54,906 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:54,906 INFO L410 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-11-07 04:42:54,906 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:54,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:54,907 INFO L82 PathProgramCache]: Analyzing trace with hash -282064210, now seen corresponding path program 1 times [2019-11-07 04:42:54,907 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:54,907 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318062968] [2019-11-07 04:42:54,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:55,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:55,289 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318062968] [2019-11-07 04:42:55,289 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:55,289 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:42:55,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897888419] [2019-11-07 04:42:55,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:42:55,291 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:55,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:42:55,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:42:55,291 INFO L87 Difference]: Start difference. First operand 3071 states and 4520 transitions. Second operand 5 states. [2019-11-07 04:42:55,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:55,583 INFO L93 Difference]: Finished difference Result 4045 states and 5966 transitions. [2019-11-07 04:42:55,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:55,583 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 130 [2019-11-07 04:42:55,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:55,599 INFO L225 Difference]: With dead ends: 4045 [2019-11-07 04:42:55,599 INFO L226 Difference]: Without dead ends: 3078 [2019-11-07 04:42:55,603 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:55,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3078 states. [2019-11-07 04:42:55,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3078 to 3067. [2019-11-07 04:42:55,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3067 states. [2019-11-07 04:42:55,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3067 states to 3067 states and 4515 transitions. [2019-11-07 04:42:55,882 INFO L78 Accepts]: Start accepts. Automaton has 3067 states and 4515 transitions. Word has length 130 [2019-11-07 04:42:55,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:55,883 INFO L462 AbstractCegarLoop]: Abstraction has 3067 states and 4515 transitions. [2019-11-07 04:42:55,883 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:42:55,883 INFO L276 IsEmpty]: Start isEmpty. Operand 3067 states and 4515 transitions. [2019-11-07 04:42:55,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-07 04:42:55,886 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:55,886 INFO L410 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-11-07 04:42:55,886 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:55,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:55,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1109472631, now seen corresponding path program 1 times [2019-11-07 04:42:55,887 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:55,888 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633071849] [2019-11-07 04:42:55,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:56,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:42:56,335 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633071849] [2019-11-07 04:42:56,336 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:42:56,336 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-07 04:42:56,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111526925] [2019-11-07 04:42:56,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-07 04:42:56,337 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:42:56,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-07 04:42:56,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-11-07 04:42:56,339 INFO L87 Difference]: Start difference. First operand 3067 states and 4515 transitions. Second operand 6 states. [2019-11-07 04:42:56,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:42:56,759 INFO L93 Difference]: Finished difference Result 8269 states and 12198 transitions. [2019-11-07 04:42:56,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:42:56,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 130 [2019-11-07 04:42:56,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:42:56,785 INFO L225 Difference]: With dead ends: 8269 [2019-11-07 04:42:56,786 INFO L226 Difference]: Without dead ends: 5366 [2019-11-07 04:42:56,797 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-11-07 04:42:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5366 states. [2019-11-07 04:42:57,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5366 to 5364. [2019-11-07 04:42:57,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5364 states. [2019-11-07 04:42:57,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5364 states to 5364 states and 7820 transitions. [2019-11-07 04:42:57,189 INFO L78 Accepts]: Start accepts. Automaton has 5364 states and 7820 transitions. Word has length 130 [2019-11-07 04:42:57,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:42:57,189 INFO L462 AbstractCegarLoop]: Abstraction has 5364 states and 7820 transitions. [2019-11-07 04:42:57,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-07 04:42:57,190 INFO L276 IsEmpty]: Start isEmpty. Operand 5364 states and 7820 transitions. [2019-11-07 04:42:57,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 04:42:57,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:42:57,193 INFO L410 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] [2019-11-07 04:42:57,194 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:42:57,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:42:57,194 INFO L82 PathProgramCache]: Analyzing trace with hash 737658540, now seen corresponding path program 1 times [2019-11-07 04:42:57,194 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:42:57,195 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783147392] [2019-11-07 04:42:57,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:42:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:42:58,654 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 48 [2019-11-07 04:42:58,841 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-11-07 04:42:59,017 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 48 [2019-11-07 04:42:59,163 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 53 [2019-11-07 04:42:59,350 WARN L191 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 64 [2019-11-07 04:42:59,506 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 55 [2019-11-07 04:42:59,699 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 59 [2019-11-07 04:42:59,893 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 65 [2019-11-07 04:43:00,094 WARN L191 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-11-07 04:43:00,326 WARN L191 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 73 [2019-11-07 04:43:00,542 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-07 04:43:00,769 WARN L191 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 67 [2019-11-07 04:43:00,968 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 55 [2019-11-07 04:43:01,129 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 32 [2019-11-07 04:43:01,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:43:01,542 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783147392] [2019-11-07 04:43:01,542 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:01,542 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2019-11-07 04:43:01,542 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328212237] [2019-11-07 04:43:01,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-11-07 04:43:01,543 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:01,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-11-07 04:43:01,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-11-07 04:43:01,544 INFO L87 Difference]: Start difference. First operand 5364 states and 7820 transitions. Second operand 28 states. [2019-11-07 04:43:02,048 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 48 [2019-11-07 04:43:02,292 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 53 [2019-11-07 04:43:02,535 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 58 [2019-11-07 04:43:02,881 WARN L191 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 64 [2019-11-07 04:43:03,182 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 68 [2019-11-07 04:43:03,682 WARN L191 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 73 [2019-11-07 04:43:04,181 WARN L191 SmtUtils]: Spent 320.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 89 [2019-11-07 04:43:04,605 WARN L191 SmtUtils]: Spent 313.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 95 [2019-11-07 04:43:05,014 WARN L191 SmtUtils]: Spent 324.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 99 [2019-11-07 04:43:05,594 WARN L191 SmtUtils]: Spent 356.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2019-11-07 04:43:06,036 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 110 [2019-11-07 04:43:06,763 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 122 [2019-11-07 04:43:07,382 WARN L191 SmtUtils]: Spent 495.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 133 [2019-11-07 04:43:07,809 WARN L191 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 101 [2019-11-07 04:43:10,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:10,556 INFO L93 Difference]: Finished difference Result 7779 states and 11186 transitions. [2019-11-07 04:43:10,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-07 04:43:10,557 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 135 [2019-11-07 04:43:10,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:10,582 INFO L225 Difference]: With dead ends: 7779 [2019-11-07 04:43:10,582 INFO L226 Difference]: Without dead ends: 6109 [2019-11-07 04:43:10,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=400, Invalid=1322, Unknown=0, NotChecked=0, Total=1722 [2019-11-07 04:43:10,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6109 states. [2019-11-07 04:43:10,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6109 to 5457. [2019-11-07 04:43:10,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-11-07 04:43:10,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7933 transitions. [2019-11-07 04:43:10,990 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7933 transitions. Word has length 135 [2019-11-07 04:43:10,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:10,990 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7933 transitions. [2019-11-07 04:43:10,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-11-07 04:43:10,991 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7933 transitions. [2019-11-07 04:43:10,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 04:43:10,995 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:10,995 INFO L410 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] [2019-11-07 04:43:10,996 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:10,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:10,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1899059121, now seen corresponding path program 1 times [2019-11-07 04:43:10,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:10,996 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293743805] [2019-11-07 04:43:10,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:11,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:11,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:43:11,112 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293743805] [2019-11-07 04:43:11,112 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:11,113 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:11,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123523486] [2019-11-07 04:43:11,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:11,114 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:11,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:11,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:11,114 INFO L87 Difference]: Start difference. First operand 5457 states and 7933 transitions. Second operand 5 states. [2019-11-07 04:43:11,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:11,791 INFO L93 Difference]: Finished difference Result 10729 states and 15636 transitions. [2019-11-07 04:43:11,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:11,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-07 04:43:11,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:11,807 INFO L225 Difference]: With dead ends: 10729 [2019-11-07 04:43:11,807 INFO L226 Difference]: Without dead ends: 5457 [2019-11-07 04:43:11,819 INFO L630 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-11-07 04:43:11,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5457 states. [2019-11-07 04:43:12,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5457 to 5457. [2019-11-07 04:43:12,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5457 states. [2019-11-07 04:43:12,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5457 states to 5457 states and 7829 transitions. [2019-11-07 04:43:12,291 INFO L78 Accepts]: Start accepts. Automaton has 5457 states and 7829 transitions. Word has length 135 [2019-11-07 04:43:12,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:12,291 INFO L462 AbstractCegarLoop]: Abstraction has 5457 states and 7829 transitions. [2019-11-07 04:43:12,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:12,291 INFO L276 IsEmpty]: Start isEmpty. Operand 5457 states and 7829 transitions. [2019-11-07 04:43:12,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 04:43:12,296 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:12,296 INFO L410 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] [2019-11-07 04:43:12,296 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:12,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:12,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1203308834, now seen corresponding path program 1 times [2019-11-07 04:43:12,297 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:12,297 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10413856] [2019-11-07 04:43:12,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:13,377 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-11-07 04:43:13,808 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-11-07 04:43:14,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:43:14,195 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10413856] [2019-11-07 04:43:14,195 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:14,195 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-11-07 04:43:14,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449846183] [2019-11-07 04:43:14,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-11-07 04:43:14,196 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:14,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-11-07 04:43:14,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-11-07 04:43:14,196 INFO L87 Difference]: Start difference. First operand 5457 states and 7829 transitions. Second operand 21 states. [2019-11-07 04:43:14,606 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 31 [2019-11-07 04:43:15,349 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 58 [2019-11-07 04:43:15,589 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 70 [2019-11-07 04:43:15,974 WARN L191 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 75 [2019-11-07 04:43:16,465 WARN L191 SmtUtils]: Spent 326.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 89 [2019-11-07 04:43:16,827 WARN L191 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 93 [2019-11-07 04:43:17,097 WARN L191 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-11-07 04:43:19,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:19,256 INFO L93 Difference]: Finished difference Result 7736 states and 11003 transitions. [2019-11-07 04:43:19,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-11-07 04:43:19,256 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 135 [2019-11-07 04:43:19,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:19,270 INFO L225 Difference]: With dead ends: 7736 [2019-11-07 04:43:19,270 INFO L226 Difference]: Without dead ends: 6066 [2019-11-07 04:43:19,276 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=284, Invalid=976, Unknown=0, NotChecked=0, Total=1260 [2019-11-07 04:43:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6066 states. [2019-11-07 04:43:19,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6066 to 5628. [2019-11-07 04:43:19,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5628 states. [2019-11-07 04:43:19,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5628 states to 5628 states and 8034 transitions. [2019-11-07 04:43:19,628 INFO L78 Accepts]: Start accepts. Automaton has 5628 states and 8034 transitions. Word has length 135 [2019-11-07 04:43:19,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:19,629 INFO L462 AbstractCegarLoop]: Abstraction has 5628 states and 8034 transitions. [2019-11-07 04:43:19,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-11-07 04:43:19,629 INFO L276 IsEmpty]: Start isEmpty. Operand 5628 states and 8034 transitions. [2019-11-07 04:43:19,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 04:43:19,635 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:19,635 INFO L410 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] [2019-11-07 04:43:19,636 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:19,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:19,636 INFO L82 PathProgramCache]: Analyzing trace with hash 575334980, now seen corresponding path program 1 times [2019-11-07 04:43:19,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:19,636 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275729171] [2019-11-07 04:43:19,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 04:43:20,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 04:43:20,111 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275729171] [2019-11-07 04:43:20,111 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 04:43:20,111 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-07 04:43:20,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173192005] [2019-11-07 04:43:20,112 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-07 04:43:20,112 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 04:43:20,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-07 04:43:20,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-07 04:43:20,113 INFO L87 Difference]: Start difference. First operand 5628 states and 8034 transitions. Second operand 5 states. [2019-11-07 04:43:20,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 04:43:20,666 INFO L93 Difference]: Finished difference Result 10669 states and 15572 transitions. [2019-11-07 04:43:20,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-07 04:43:20,667 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-11-07 04:43:20,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 04:43:20,682 INFO L225 Difference]: With dead ends: 10669 [2019-11-07 04:43:20,682 INFO L226 Difference]: Without dead ends: 6024 [2019-11-07 04:43:20,695 INFO L630 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-11-07 04:43:20,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6024 states. [2019-11-07 04:43:21,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6024 to 4824. [2019-11-07 04:43:21,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4824 states. [2019-11-07 04:43:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4824 states to 4824 states and 6879 transitions. [2019-11-07 04:43:21,082 INFO L78 Accepts]: Start accepts. Automaton has 4824 states and 6879 transitions. Word has length 135 [2019-11-07 04:43:21,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 04:43:21,083 INFO L462 AbstractCegarLoop]: Abstraction has 4824 states and 6879 transitions. [2019-11-07 04:43:21,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-07 04:43:21,083 INFO L276 IsEmpty]: Start isEmpty. Operand 4824 states and 6879 transitions. [2019-11-07 04:43:21,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-11-07 04:43:21,086 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 04:43:21,087 INFO L410 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] [2019-11-07 04:43:21,087 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 04:43:21,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 04:43:21,087 INFO L82 PathProgramCache]: Analyzing trace with hash -785554146, now seen corresponding path program 1 times [2019-11-07 04:43:21,087 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 04:43:21,088 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883752701] [2019-11-07 04:43:21,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 04:43:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat