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_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:22,273 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:22,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:22,296 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:22,296 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:22,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:22,300 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:22,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:22,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:22,309 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:22,313 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:22,314 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:22,315 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:22,317 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:22,318 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:22,319 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:22,320 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:22,321 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:22,322 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:22,324 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:22,325 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:22,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:22,327 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:22,328 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:22,330 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:22,330 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:22,331 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:22,331 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:22,333 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:22,334 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:22,334 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:22,335 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:22,337 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:22,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:22,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:22,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:22,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:22,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:22,340 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:22,344 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:22,345 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:22,349 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:28:22,373 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:22,373 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:22,375 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:22,375 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:22,375 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:22,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:22,376 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:22,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:22,377 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:22,377 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:22,378 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:22,378 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:22,378 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:22,379 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:22,379 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:22,379 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:22,379 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:22,380 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:22,380 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:22,380 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:22,380 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:22,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:22,381 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:22,381 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:22,381 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:22,381 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:22,381 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:22,382 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:22,382 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:22,692 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:22,711 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:22,714 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:22,716 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:22,716 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:22,717 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-07 13:28:22,789 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb61ece1/00b85b9f698d4717ac0d24541e8d266a/FLAG4929efb1f [2019-10-07 13:28:23,270 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:23,271 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-07 13:28:23,287 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb61ece1/00b85b9f698d4717ac0d24541e8d266a/FLAG4929efb1f [2019-10-07 13:28:23,629 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fb61ece1/00b85b9f698d4717ac0d24541e8d266a [2019-10-07 13:28:23,640 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:23,642 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:23,643 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:23,643 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:23,646 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:23,647 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3304fef9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23, skipping insertion in model container [2019-10-07 13:28:23,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,657 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:23,677 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:23,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:23,860 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:23,885 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:23,986 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:23,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23 WrapperNode [2019-10-07 13:28:23,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:23,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:23,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:23,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:23,998 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,024 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:24,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:24,032 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:24,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:24,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:24,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28: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-10-07 13:28:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:24,094 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:24,094 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:24,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:24,667 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:24,668 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:24,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:24 BoogieIcfgContainer [2019-10-07 13:28:24,670 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:24,671 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:24,671 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:24,675 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:24,675 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:23" (1/3) ... [2019-10-07 13:28:24,676 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e3e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:24, skipping insertion in model container [2019-10-07 13:28:24,676 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (2/3) ... [2019-10-07 13:28:24,677 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94e3e76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:24, skipping insertion in model container [2019-10-07 13:28:24,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:24" (3/3) ... [2019-10-07 13:28:24,679 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-07 13:28:24,690 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:24,698 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:24,710 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:24,741 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:24,741 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:24,742 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:24,742 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:24,748 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:24,748 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:24,749 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:24,749 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-07 13:28:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:24,771 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:24,772 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:24,774 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:24,780 INFO L82 PathProgramCache]: Analyzing trace with hash 563061398, now seen corresponding path program 1 times [2019-10-07 13:28:24,790 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:24,790 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,790 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,791 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:24,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,004 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,005 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,006 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,007 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,029 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-10-07 13:28:25,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,115 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2019-10-07 13:28:25,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,118 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:25,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,141 INFO L225 Difference]: With dead ends: 70 [2019-10-07 13:28:25,141 INFO L226 Difference]: Without dead ends: 55 [2019-10-07 13:28:25,147 INFO L606 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-10-07 13:28:25,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-07 13:28:25,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-10-07 13:28:25,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-10-07 13:28:25,215 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10 [2019-10-07 13:28:25,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,216 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-10-07 13:28:25,216 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,216 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-10-07 13:28:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:25,218 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,219 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,220 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,222 INFO L82 PathProgramCache]: Analyzing trace with hash 275247210, now seen corresponding path program 1 times [2019-10-07 13:28:25,222 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,223 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,224 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,351 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,352 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,352 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,357 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-10-07 13:28:25,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,400 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2019-10-07 13:28:25,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,401 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:25,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,403 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:28:25,403 INFO L226 Difference]: Without dead ends: 53 [2019-10-07 13:28:25,405 INFO L606 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-10-07 13:28:25,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-07 13:28:25,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-10-07 13:28:25,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2019-10-07 13:28:25,419 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11 [2019-10-07 13:28:25,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,419 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2019-10-07 13:28:25,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,420 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2019-10-07 13:28:25,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:25,422 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,422 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,423 INFO L82 PathProgramCache]: Analyzing trace with hash -57057685, now seen corresponding path program 1 times [2019-10-07 13:28:25,424 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,424 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,424 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,525 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,526 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,526 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,527 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,528 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 4 states. [2019-10-07 13:28:25,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,565 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2019-10-07 13:28:25,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,566 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:25,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,567 INFO L225 Difference]: With dead ends: 53 [2019-10-07 13:28:25,567 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 13:28:25,568 INFO L606 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-10-07 13:28:25,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 13:28:25,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-10-07 13:28:25,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2019-10-07 13:28:25,581 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12 [2019-10-07 13:28:25,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,582 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2019-10-07 13:28:25,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,583 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2019-10-07 13:28:25,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:25,584 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,584 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,584 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1768574497, now seen corresponding path program 1 times [2019-10-07 13:28:25,586 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,587 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,587 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,663 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,663 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,663 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,665 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states. [2019-10-07 13:28:25,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,687 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2019-10-07 13:28:25,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,688 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:25,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,689 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:28:25,689 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 13:28:25,690 INFO L606 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-10-07 13:28:25,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 13:28:25,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2019-10-07 13:28:25,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2019-10-07 13:28:25,695 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2019-10-07 13:28:25,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,696 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2019-10-07 13:28:25,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2019-10-07 13:28:25,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:25,697 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,697 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,697 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1008979520, now seen corresponding path program 1 times [2019-10-07 13:28:25,698 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,699 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,699 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,759 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,759 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,759 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,760 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,760 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. [2019-10-07 13:28:25,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,787 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2019-10-07 13:28:25,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:25,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,789 INFO L225 Difference]: With dead ends: 49 [2019-10-07 13:28:25,789 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:28:25,790 INFO L606 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-10-07 13:28:25,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:28:25,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-10-07 13:28:25,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2019-10-07 13:28:25,795 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2019-10-07 13:28:25,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,795 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2019-10-07 13:28:25,795 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,795 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2019-10-07 13:28:25,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:25,796 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,796 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,797 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1213808468, now seen corresponding path program 1 times [2019-10-07 13:28:25,797 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,797 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,798 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,852 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,852 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,854 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 4 states. [2019-10-07 13:28:25,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,876 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2019-10-07 13:28:25,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,878 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:28:25,878 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:28:25,879 INFO L606 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-10-07 13:28:25,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:28:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-10-07 13:28:25,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-10-07 13:28:25,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15 [2019-10-07 13:28:25,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,884 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-07 13:28:25,884 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-10-07 13:28:25,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:25,885 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,885 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,885 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1026428395, now seen corresponding path program 1 times [2019-10-07 13:28:25,886 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,886 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,887 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,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-10-07 13:28:25,923 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,923 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,924 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,925 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 4 states. [2019-10-07 13:28:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,957 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-07 13:28:25,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,958 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,959 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:25,959 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:25,959 INFO L606 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-10-07 13:28:25,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-07 13:28:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:25,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-10-07 13:28:25,966 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-10-07 13:28:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,966 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-10-07 13:28:25,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,967 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-10-07 13:28:25,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:25,968 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,968 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,968 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1754294071, now seen corresponding path program 1 times [2019-10-07 13:28:25,970 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,970 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,970 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,970 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:26,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:26,019 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,020 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:26,020 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:26,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:26,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:26,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:26,021 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 4 states. [2019-10-07 13:28:26,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:26,042 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-10-07 13:28:26,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:26,043 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:26,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:26,044 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:28:26,044 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:28:26,045 INFO L606 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-10-07 13:28:26,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:28:26,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-10-07 13:28:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:26,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-10-07 13:28:26,048 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2019-10-07 13:28:26,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:26,049 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-10-07 13:28:26,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:26,049 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2019-10-07 13:28:26,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:28:26,050 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:26,050 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:26,050 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:26,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:26,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1451674090, now seen corresponding path program 1 times [2019-10-07 13:28:26,051 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:26,051 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,051 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:26,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:26,085 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:26,086 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,086 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:26,086 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:26,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:26,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:26,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:26,087 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 4 states. [2019-10-07 13:28:26,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:26,110 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-07 13:28:26,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:26,111 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:28:26,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:26,112 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:28:26,112 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:26,113 INFO L606 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-10-07 13:28:26,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:26,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-10-07 13:28:26,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-10-07 13:28:26,118 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 18 [2019-10-07 13:28:26,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:26,118 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-10-07 13:28:26,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:26,119 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2019-10-07 13:28:26,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:28:26,119 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:26,119 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:26,120 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:26,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:26,121 INFO L82 PathProgramCache]: Analyzing trace with hash 2052439614, now seen corresponding path program 1 times [2019-10-07 13:28:26,121 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:26,122 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,122 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,122 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:26,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:26,161 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,162 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:26,162 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:26,162 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:26,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:26,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:26,163 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 4 states. [2019-10-07 13:28:26,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:26,180 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-07 13:28:26,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:26,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-07 13:28:26,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:26,182 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:26,182 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:28:26,182 INFO L606 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-10-07 13:28:26,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:28:26,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-10-07 13:28:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:28:26,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-07 13:28:26,185 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2019-10-07 13:28:26,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:26,186 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-07 13:28:26,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:26,186 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-07 13:28:26,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:28:26,187 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:26,187 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:26,187 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:26,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:26,188 INFO L82 PathProgramCache]: Analyzing trace with hash -798665281, now seen corresponding path program 1 times [2019-10-07 13:28:26,188 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:26,188 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,188 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,189 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:26,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:26,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:26,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:26,237 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:26,238 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:26,238 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:26,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:26,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:26,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:26,239 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-10-07 13:28:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:26,259 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-07 13:28:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:26,260 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-07 13:28:26,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:26,260 INFO L225 Difference]: With dead ends: 33 [2019-10-07 13:28:26,260 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:26,261 INFO L606 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-10-07 13:28:26,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:26,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:26,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:26,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:26,262 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-07 13:28:26,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:26,262 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:26,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:26,263 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:26,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:26,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:26,287 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:26,287 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:26,287 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:26,287 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:26,288 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:26,288 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:26,288 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-07 13:28:26,288 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-07 13:28:26,288 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-07 13:28:26,288 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-07 13:28:26,289 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-07 13:28:26,289 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-07 13:28:26,289 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,289 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,289 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,289 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,290 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-07 13:28:26,291 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-07 13:28:26,291 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-07 13:28:26,291 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,291 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,291 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,292 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-07 13:28:26,293 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-07 13:28:26,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:26 BoogieIcfgContainer [2019-10-07 13:28:26,302 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:26,305 INFO L168 Benchmark]: Toolchain (without parser) took 2661.93 ms. Allocated memory was 138.9 MB in the beginning and 237.0 MB in the end (delta: 98.0 MB). Free memory was 102.6 MB in the beginning and 140.9 MB in the end (delta: -38.3 MB). Peak memory consumption was 59.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,306 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,307 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.08 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 183.2 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,308 INFO L168 Benchmark]: Boogie Preprocessor took 43.91 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,308 INFO L168 Benchmark]: RCFGBuilder took 637.35 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 142.5 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,309 INFO L168 Benchmark]: TraceAbstraction took 1630.69 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 141.8 MB in the beginning and 140.9 MB in the end (delta: 948.3 kB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:26,313 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.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 345.08 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 102.4 MB in the beginning and 183.2 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.91 ms. Allocated memory is still 203.9 MB. Free memory was 183.2 MB in the beginning and 180.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 637.35 ms. Allocated memory is still 203.9 MB. Free memory was 180.8 MB in the beginning and 142.5 MB in the end (delta: 38.3 MB). Peak memory consumption was 38.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1630.69 ms. Allocated memory was 203.9 MB in the beginning and 237.0 MB in the end (delta: 33.0 MB). Free memory was 141.8 MB in the beginning and 140.9 MB in the end (delta: 948.3 kB). Peak memory consumption was 34.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: 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: 42]: 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, 36 locations, 1 error locations. Result: SAFE, OverallTime: 1.5s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 492 SDtfs, 376 SDslu, 700 SDs, 0 SdLazy, 99 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 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.4s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 8778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...