/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/locks/test_locks_15-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:58:22,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:58:22,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:58:22,071 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:58:22,072 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:58:22,073 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:58:22,074 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:58:22,076 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:58:22,078 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:58:22,078 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:58:22,079 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:58:22,080 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:58:22,081 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:58:22,082 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:58:22,083 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:58:22,084 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:58:22,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:58:22,085 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:58:22,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:58:22,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:58:22,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:58:22,091 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:58:22,092 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:58:22,093 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:58:22,095 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:58:22,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:58:22,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:58:22,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:58:22,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:58:22,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:58:22,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:58:22,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:58:22,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:58:22,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:58:22,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:58:22,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:58:22,102 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:58:22,102 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:58:22,103 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:58:22,103 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:58:22,104 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:58:22,105 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 03:58:22,119 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:58:22,119 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:58:22,120 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:58:22,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:58:22,121 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:58:22,121 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:58:22,121 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:58:22,121 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:58:22,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:58:22,122 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:58:22,122 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:58:22,122 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:58:22,122 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:58:22,122 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:58:22,123 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:58:22,123 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:58:22,123 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:58:22,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:58:22,124 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:58:22,124 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:58:22,124 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:58:22,124 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:22,124 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:58:22,125 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:58:22,125 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:58:22,125 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:58:22,125 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:58:22,125 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:58:22,126 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 03:58:22,462 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:58:22,477 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:58:22,481 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:58:22,482 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:58:22,483 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:58:22,483 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_15-2.c [2019-11-07 03:58:22,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d52820/90ffcab759504fe7b7231576e2540b4e/FLAG7a5f79cb3 [2019-11-07 03:58:23,038 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:58:23,039 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_15-2.c [2019-11-07 03:58:23,052 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d52820/90ffcab759504fe7b7231576e2540b4e/FLAG7a5f79cb3 [2019-11-07 03:58:23,400 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b3d52820/90ffcab759504fe7b7231576e2540b4e [2019-11-07 03:58:23,411 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:58:23,413 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:58:23,416 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:23,416 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:58:23,420 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:58:23,421 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,424 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a5ce1b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23, skipping insertion in model container [2019-11-07 03:58:23,424 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,433 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:58:23,475 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:58:23,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:23,702 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:58:23,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:23,836 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:58:23,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23 WrapperNode [2019-11-07 03:58:23,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:23,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:58:23,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:58:23,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:58:23,852 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,852 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,866 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (1/1) ... [2019-11-07 03:58:23,880 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:58:23,880 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:58:23,880 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:58:23,880 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:58:23,881 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (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 03:58:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:58:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:58:23,935 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:58:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:58:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:58:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:58:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:58:23,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:58:24,611 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:58:24,611 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 03:58:24,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:24 BoogieIcfgContainer [2019-11-07 03:58:24,613 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:58:24,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:58:24,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:58:24,618 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:58:24,618 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:23" (1/3) ... [2019-11-07 03:58:24,619 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167ab7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:24, skipping insertion in model container [2019-11-07 03:58:24,619 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:23" (2/3) ... [2019-11-07 03:58:24,620 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@167ab7b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:24, skipping insertion in model container [2019-11-07 03:58:24,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:24" (3/3) ... [2019-11-07 03:58:24,622 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_15-2.c [2019-11-07 03:58:24,632 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:58:24,641 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:58:24,654 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:58:24,680 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:58:24,681 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:58:24,681 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:58:24,681 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:58:24,682 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:58:24,682 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:58:24,682 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:58:24,682 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:58:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2019-11-07 03:58:24,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 03:58:24,709 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:24,710 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:24,712 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:24,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:24,718 INFO L82 PathProgramCache]: Analyzing trace with hash -1439940406, now seen corresponding path program 1 times [2019-11-07 03:58:24,728 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:24,729 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318439022] [2019-11-07 03:58:24,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:24,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:24,923 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 03:58:24,924 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318439022] [2019-11-07 03:58:24,925 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:24,925 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:24,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370346774] [2019-11-07 03:58:24,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:24,933 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:24,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:24,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:24,950 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 4 states. [2019-11-07 03:58:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,013 INFO L93 Difference]: Finished difference Result 86 states and 146 transitions. [2019-11-07 03:58:25,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 03:58:25,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,028 INFO L225 Difference]: With dead ends: 86 [2019-11-07 03:58:25,028 INFO L226 Difference]: Without dead ends: 71 [2019-11-07 03:58:25,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2019-11-07 03:58:25,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 39. [2019-11-07 03:58:25,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 67 transitions. [2019-11-07 03:58:25,078 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 67 transitions. Word has length 10 [2019-11-07 03:58:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,079 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 67 transitions. [2019-11-07 03:58:25,079 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 67 transitions. [2019-11-07 03:58:25,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 03:58:25,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,080 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,081 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1688267866, now seen corresponding path program 1 times [2019-11-07 03:58:25,082 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,082 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367209790] [2019-11-07 03:58:25,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,162 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 03:58:25,162 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367209790] [2019-11-07 03:58:25,163 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,163 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945486231] [2019-11-07 03:58:25,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,165 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,166 INFO L87 Difference]: Start difference. First operand 39 states and 67 transitions. Second operand 4 states. [2019-11-07 03:58:25,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,205 INFO L93 Difference]: Finished difference Result 71 states and 123 transitions. [2019-11-07 03:58:25,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,207 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 03:58:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,210 INFO L225 Difference]: With dead ends: 71 [2019-11-07 03:58:25,210 INFO L226 Difference]: Without dead ends: 69 [2019-11-07 03:58:25,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-11-07 03:58:25,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 39. [2019-11-07 03:58:25,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 66 transitions. [2019-11-07 03:58:25,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 66 transitions. Word has length 11 [2019-11-07 03:58:25,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,221 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 66 transitions. [2019-11-07 03:58:25,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,222 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 66 transitions. [2019-11-07 03:58:25,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 03:58:25,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,223 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,223 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,223 INFO L82 PathProgramCache]: Analyzing trace with hash -796484193, now seen corresponding path program 1 times [2019-11-07 03:58:25,224 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,224 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065654324] [2019-11-07 03:58:25,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,331 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 03:58:25,331 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065654324] [2019-11-07 03:58:25,332 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,333 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688936415] [2019-11-07 03:58:25,334 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,334 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,335 INFO L87 Difference]: Start difference. First operand 39 states and 66 transitions. Second operand 4 states. [2019-11-07 03:58:25,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,377 INFO L93 Difference]: Finished difference Result 69 states and 118 transitions. [2019-11-07 03:58:25,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,378 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 03:58:25,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,379 INFO L225 Difference]: With dead ends: 69 [2019-11-07 03:58:25,380 INFO L226 Difference]: Without dead ends: 67 [2019-11-07 03:58:25,382 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2019-11-07 03:58:25,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2019-11-07 03:58:25,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 65 transitions. [2019-11-07 03:58:25,398 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 65 transitions. Word has length 12 [2019-11-07 03:58:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,398 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 65 transitions. [2019-11-07 03:58:25,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 65 transitions. [2019-11-07 03:58:25,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 03:58:25,399 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,402 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1079006235, now seen corresponding path program 1 times [2019-11-07 03:58:25,403 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868147510] [2019-11-07 03:58:25,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:25,498 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868147510] [2019-11-07 03:58:25,499 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,499 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156438356] [2019-11-07 03:58:25,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,500 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,501 INFO L87 Difference]: Start difference. First operand 39 states and 65 transitions. Second operand 4 states. [2019-11-07 03:58:25,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,529 INFO L93 Difference]: Finished difference Result 67 states and 113 transitions. [2019-11-07 03:58:25,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-07 03:58:25,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,531 INFO L225 Difference]: With dead ends: 67 [2019-11-07 03:58:25,531 INFO L226 Difference]: Without dead ends: 65 [2019-11-07 03:58:25,534 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2019-11-07 03:58:25,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 39. [2019-11-07 03:58:25,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 64 transitions. [2019-11-07 03:58:25,545 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 64 transitions. Word has length 13 [2019-11-07 03:58:25,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,545 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 64 transitions. [2019-11-07 03:58:25,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 64 transitions. [2019-11-07 03:58:25,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 03:58:25,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,548 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,548 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,548 INFO L82 PathProgramCache]: Analyzing trace with hash -910332300, now seen corresponding path program 1 times [2019-11-07 03:58:25,549 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,550 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113561412] [2019-11-07 03:58:25,550 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,619 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 03:58:25,619 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113561412] [2019-11-07 03:58:25,620 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,620 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,620 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584771888] [2019-11-07 03:58:25,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,622 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,622 INFO L87 Difference]: Start difference. First operand 39 states and 64 transitions. Second operand 4 states. [2019-11-07 03:58:25,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,651 INFO L93 Difference]: Finished difference Result 65 states and 108 transitions. [2019-11-07 03:58:25,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 03:58:25,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,653 INFO L225 Difference]: With dead ends: 65 [2019-11-07 03:58:25,653 INFO L226 Difference]: Without dead ends: 63 [2019-11-07 03:58:25,656 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-07 03:58:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 39. [2019-11-07 03:58:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 63 transitions. [2019-11-07 03:58:25,663 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 63 transitions. Word has length 14 [2019-11-07 03:58:25,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,667 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 63 transitions. [2019-11-07 03:58:25,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,667 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 63 transitions. [2019-11-07 03:58:25,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 03:58:25,668 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,668 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1844682896, now seen corresponding path program 1 times [2019-11-07 03:58:25,670 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,670 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974123697] [2019-11-07 03:58:25,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,723 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 03:58:25,724 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974123697] [2019-11-07 03:58:25,724 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,724 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825324164] [2019-11-07 03:58:25,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,725 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,727 INFO L87 Difference]: Start difference. First operand 39 states and 63 transitions. Second operand 4 states. [2019-11-07 03:58:25,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,750 INFO L93 Difference]: Finished difference Result 63 states and 103 transitions. [2019-11-07 03:58:25,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,751 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 03:58:25,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,752 INFO L225 Difference]: With dead ends: 63 [2019-11-07 03:58:25,752 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 03:58:25,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 03:58:25,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-07 03:58:25,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 62 transitions. [2019-11-07 03:58:25,760 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 62 transitions. Word has length 15 [2019-11-07 03:58:25,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,761 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 62 transitions. [2019-11-07 03:58:25,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,761 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 62 transitions. [2019-11-07 03:58:25,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 03:58:25,762 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,765 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,765 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1350808393, now seen corresponding path program 1 times [2019-11-07 03:58:25,766 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,766 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886048693] [2019-11-07 03:58:25,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,807 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 03:58:25,807 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886048693] [2019-11-07 03:58:25,807 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,808 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075865876] [2019-11-07 03:58:25,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,809 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,809 INFO L87 Difference]: Start difference. First operand 39 states and 62 transitions. Second operand 4 states. [2019-11-07 03:58:25,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,832 INFO L93 Difference]: Finished difference Result 61 states and 98 transitions. [2019-11-07 03:58:25,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 03:58:25,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,833 INFO L225 Difference]: With dead ends: 61 [2019-11-07 03:58:25,834 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 03:58:25,834 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 03:58:25,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2019-11-07 03:58:25,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 61 transitions. [2019-11-07 03:58:25,839 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 61 transitions. Word has length 16 [2019-11-07 03:58:25,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,839 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 61 transitions. [2019-11-07 03:58:25,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,839 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 61 transitions. [2019-11-07 03:58:25,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 03:58:25,840 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,840 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,841 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1074398971, now seen corresponding path program 1 times [2019-11-07 03:58:25,841 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,841 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549630791] [2019-11-07 03:58:25,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,876 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 03:58:25,877 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549630791] [2019-11-07 03:58:25,877 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,877 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618841845] [2019-11-07 03:58:25,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,878 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,879 INFO L87 Difference]: Start difference. First operand 39 states and 61 transitions. Second operand 4 states. [2019-11-07 03:58:25,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,902 INFO L93 Difference]: Finished difference Result 59 states and 93 transitions. [2019-11-07 03:58:25,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,902 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-07 03:58:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,903 INFO L225 Difference]: With dead ends: 59 [2019-11-07 03:58:25,904 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 03:58:25,904 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 03:58:25,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 39. [2019-11-07 03:58:25,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 60 transitions. [2019-11-07 03:58:25,909 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 60 transitions. Word has length 17 [2019-11-07 03:58:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,909 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 60 transitions. [2019-11-07 03:58:25,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 60 transitions. [2019-11-07 03:58:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 03:58:25,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,911 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,912 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1053584414, now seen corresponding path program 1 times [2019-11-07 03:58:25,912 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,913 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107110935] [2019-11-07 03:58:25,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:25,947 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 03:58:25,947 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107110935] [2019-11-07 03:58:25,947 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:25,948 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:25,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985912976] [2019-11-07 03:58:25,948 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:25,949 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:25,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:25,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,949 INFO L87 Difference]: Start difference. First operand 39 states and 60 transitions. Second operand 4 states. [2019-11-07 03:58:25,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:25,968 INFO L93 Difference]: Finished difference Result 57 states and 88 transitions. [2019-11-07 03:58:25,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:25,968 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-07 03:58:25,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:25,969 INFO L225 Difference]: With dead ends: 57 [2019-11-07 03:58:25,969 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 03:58:25,970 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:25,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 03:58:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 39. [2019-11-07 03:58:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:25,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 59 transitions. [2019-11-07 03:58:25,973 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 59 transitions. Word has length 18 [2019-11-07 03:58:25,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:25,974 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 59 transitions. [2019-11-07 03:58:25,974 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:25,974 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 59 transitions. [2019-11-07 03:58:25,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 03:58:25,975 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:25,975 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:25,975 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:25,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:25,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1698407046, now seen corresponding path program 1 times [2019-11-07 03:58:25,976 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:25,976 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140382139] [2019-11-07 03:58:25,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,012 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 03:58:26,012 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140382139] [2019-11-07 03:58:26,013 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,013 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928332833] [2019-11-07 03:58:26,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,014 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,014 INFO L87 Difference]: Start difference. First operand 39 states and 59 transitions. Second operand 4 states. [2019-11-07 03:58:26,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,036 INFO L93 Difference]: Finished difference Result 55 states and 83 transitions. [2019-11-07 03:58:26,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,036 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-07 03:58:26,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,038 INFO L225 Difference]: With dead ends: 55 [2019-11-07 03:58:26,038 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 03:58:26,039 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 03:58:26,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-11-07 03:58:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:26,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 58 transitions. [2019-11-07 03:58:26,044 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 58 transitions. Word has length 19 [2019-11-07 03:58:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,045 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 58 transitions. [2019-11-07 03:58:26,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,045 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 58 transitions. [2019-11-07 03:58:26,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 03:58:26,046 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:26,046 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] [2019-11-07 03:58:26,046 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:26,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:26,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1110796045, now seen corresponding path program 1 times [2019-11-07 03:58:26,047 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:26,047 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637837114] [2019-11-07 03:58:26,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:26,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,075 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 03:58:26,075 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637837114] [2019-11-07 03:58:26,076 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,076 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842036864] [2019-11-07 03:58:26,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,077 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,077 INFO L87 Difference]: Start difference. First operand 39 states and 58 transitions. Second operand 4 states. [2019-11-07 03:58:26,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,092 INFO L93 Difference]: Finished difference Result 53 states and 78 transitions. [2019-11-07 03:58:26,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 03:58:26,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,093 INFO L225 Difference]: With dead ends: 53 [2019-11-07 03:58:26,093 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 03:58:26,094 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 03:58:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2019-11-07 03:58:26,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:26,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 57 transitions. [2019-11-07 03:58:26,097 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 57 transitions. Word has length 20 [2019-11-07 03:58:26,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,097 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 57 transitions. [2019-11-07 03:58:26,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,098 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 57 transitions. [2019-11-07 03:58:26,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 03:58:26,098 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:26,099 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] [2019-11-07 03:58:26,099 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash -74723857, now seen corresponding path program 1 times [2019-11-07 03:58:26,099 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:26,100 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576551417] [2019-11-07 03:58:26,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:26,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,136 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 03:58:26,136 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576551417] [2019-11-07 03:58:26,137 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,137 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019093209] [2019-11-07 03:58:26,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,138 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,138 INFO L87 Difference]: Start difference. First operand 39 states and 57 transitions. Second operand 4 states. [2019-11-07 03:58:26,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,166 INFO L93 Difference]: Finished difference Result 51 states and 73 transitions. [2019-11-07 03:58:26,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 03:58:26,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,168 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:58:26,168 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 03:58:26,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 03:58:26,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 39. [2019-11-07 03:58:26,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:26,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2019-11-07 03:58:26,174 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 21 [2019-11-07 03:58:26,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,177 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2019-11-07 03:58:26,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,177 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2019-11-07 03:58:26,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 03:58:26,178 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:26,178 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] [2019-11-07 03:58:26,179 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:26,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:26,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1978743240, now seen corresponding path program 1 times [2019-11-07 03:58:26,179 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:26,180 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365217634] [2019-11-07 03:58:26,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,222 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 03:58:26,223 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365217634] [2019-11-07 03:58:26,223 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,224 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956092797] [2019-11-07 03:58:26,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,225 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,226 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand 4 states. [2019-11-07 03:58:26,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,249 INFO L93 Difference]: Finished difference Result 49 states and 68 transitions. [2019-11-07 03:58:26,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-07 03:58:26,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,251 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:58:26,251 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 03:58:26,252 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 03:58:26,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 39. [2019-11-07 03:58:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2019-11-07 03:58:26,255 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 22 [2019-11-07 03:58:26,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,257 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2019-11-07 03:58:26,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,258 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2019-11-07 03:58:26,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-07 03:58:26,260 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:26,261 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] [2019-11-07 03:58:26,261 INFO L410 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:26,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:26,261 INFO L82 PathProgramCache]: Analyzing trace with hash 1211714148, now seen corresponding path program 1 times [2019-11-07 03:58:26,262 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:26,263 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451263580] [2019-11-07 03:58:26,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,322 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 03:58:26,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451263580] [2019-11-07 03:58:26,324 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,324 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,324 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364212200] [2019-11-07 03:58:26,325 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,325 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,328 INFO L87 Difference]: Start difference. First operand 39 states and 55 transitions. Second operand 4 states. [2019-11-07 03:58:26,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,346 INFO L93 Difference]: Finished difference Result 47 states and 63 transitions. [2019-11-07 03:58:26,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-11-07 03:58:26,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,348 INFO L225 Difference]: With dead ends: 47 [2019-11-07 03:58:26,348 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:58:26,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:58:26,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2019-11-07 03:58:26,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-07 03:58:26,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 54 transitions. [2019-11-07 03:58:26,354 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 54 transitions. Word has length 23 [2019-11-07 03:58:26,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,355 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 54 transitions. [2019-11-07 03:58:26,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,355 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2019-11-07 03:58:26,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-07 03:58:26,356 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:26,356 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] [2019-11-07 03:58:26,356 INFO L410 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:26,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:26,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1091350883, now seen corresponding path program 1 times [2019-11-07 03:58:26,361 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:26,361 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404535749] [2019-11-07 03:58:26,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:26,397 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 03:58:26,398 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404535749] [2019-11-07 03:58:26,399 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:26,399 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:26,399 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875870972] [2019-11-07 03:58:26,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:26,400 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:26,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:26,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,402 INFO L87 Difference]: Start difference. First operand 39 states and 54 transitions. Second operand 4 states. [2019-11-07 03:58:26,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:26,420 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-11-07 03:58:26,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:26,421 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-11-07 03:58:26,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:26,421 INFO L225 Difference]: With dead ends: 41 [2019-11-07 03:58:26,421 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 03:58:26,422 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:26,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 03:58:26,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 03:58:26,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 03:58:26,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 03:58:26,432 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2019-11-07 03:58:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:26,432 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 03:58:26,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 03:58:26,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 03:58:26,438 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 03:58:26,453 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 03:58:26,453 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:26,453 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:26,453 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 03:58:26,454 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 233) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L168-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L218-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L219(line 219) no Hoare annotation was computed. [2019-11-07 03:58:26,454 INFO L443 ceAbstractionStarter]: For program point L153-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 233) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L203-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L188-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L56(lines 56 58) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2019-11-07 03:58:26,455 INFO L443 ceAbstractionStarter]: For program point L173-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L446 ceAbstractionStarter]: At program point L223-1(lines 54 228) the Hoare annotation is: true [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L224(line 224) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L439 ceAbstractionStarter]: At program point L224-1(lines 5 233) the Hoare annotation is: false [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L158-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L208-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2019-11-07 03:58:26,456 INFO L443 ceAbstractionStarter]: For program point L209(line 209) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point L193-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point L194(line 194) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point L178-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 233) the Hoare annotation is: true [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point L179(line 179) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L446 ceAbstractionStarter]: At program point L229(lines 5 233) the Hoare annotation is: true [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point L163-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,457 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 231) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L213-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L164(line 164) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L214(line 214) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L198-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-11-07 03:58:26,458 INFO L443 ceAbstractionStarter]: For program point L183-1(lines 54 228) no Hoare annotation was computed. [2019-11-07 03:58:26,467 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:58:26 BoogieIcfgContainer [2019-11-07 03:58:26,467 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 03:58:26,470 INFO L168 Benchmark]: Toolchain (without parser) took 3056.01 ms. Allocated memory was 145.8 MB in the beginning and 246.9 MB in the end (delta: 101.2 MB). Free memory was 103.7 MB in the beginning and 214.6 MB in the end (delta: -110.9 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-07 03:58:26,471 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 03:58:26,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 421.65 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 180.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:26,472 INFO L168 Benchmark]: Boogie Preprocessor took 41.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:26,473 INFO L168 Benchmark]: RCFGBuilder took 733.12 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 129.7 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:26,474 INFO L168 Benchmark]: TraceAbstraction took 1852.77 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 129.0 MB in the beginning and 214.6 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-07 03:58:26,477 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 421.65 ms. Allocated memory was 145.8 MB in the beginning and 201.9 MB in the end (delta: 56.1 MB). Free memory was 103.5 MB in the beginning and 180.6 MB in the end (delta: -77.1 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.63 ms. Allocated memory is still 201.9 MB. Free memory was 180.6 MB in the beginning and 178.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.12 ms. Allocated memory is still 201.9 MB. Free memory was 178.6 MB in the beginning and 129.7 MB in the end (delta: 48.9 MB). Peak memory consumption was 48.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1852.77 ms. Allocated memory was 201.9 MB in the beginning and 246.9 MB in the end (delta: 45.1 MB). Free memory was 129.0 MB in the beginning and 214.6 MB in the end (delta: -85.6 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 231]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 44 locations, 1 error locations. Result: SAFE, OverallTime: 1.7s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 878 SDtfs, 692 SDslu, 1282 SDs, 0 SdLazy, 135 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 266 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 255 NumberOfCodeBlocks, 255 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 17800 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...