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_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:44,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:44,293 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:44,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:44,312 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:44,314 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:44,316 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:44,325 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:44,330 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:44,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:44,335 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:44,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:44,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:44,338 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:44,341 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:44,342 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:44,343 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:44,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:44,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:44,350 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:44,354 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:44,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:44,359 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:44,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:44,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:44,362 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:44,362 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:44,363 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:44,364 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:44,365 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:44,365 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:44,367 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:44,367 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:44,368 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:44,370 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:44,370 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:44,370 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:44,371 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:44,371 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:44,372 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:44,373 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:44,374 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-15 03:00:44,401 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:44,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:44,405 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:44,405 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:44,405 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:44,406 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:44,406 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:44,406 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:44,406 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:44,406 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:44,407 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:44,407 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:44,407 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:44,407 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:44,407 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:44,408 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:44,408 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:44,408 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:44,408 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:44,408 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:44,409 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:44,409 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:44,409 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:44,409 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:44,409 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:44,410 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:44,410 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:44,410 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:44,410 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-15 03:00:44,678 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:44,691 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:44,695 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:44,697 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:44,697 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:44,698 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-10-15 03:00:44,760 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1974bbf84/0bca0a8396b1481b8e00824bdf706a52/FLAG7794dc6a5 [2019-10-15 03:00:45,197 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:45,198 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-15 03:00:45,210 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1974bbf84/0bca0a8396b1481b8e00824bdf706a52/FLAG7794dc6a5 [2019-10-15 03:00:45,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1974bbf84/0bca0a8396b1481b8e00824bdf706a52 [2019-10-15 03:00:45,576 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:45,577 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:45,578 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:45,579 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:45,582 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:45,583 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:45,586 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c19cb95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45, skipping insertion in model container [2019-10-15 03:00:45,586 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:45,593 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:45,625 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:45,820 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:45,831 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:45,887 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:45,980 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:45,980 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45 WrapperNode [2019-10-15 03:00:45,981 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:45,981 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:45,981 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:45,981 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:45,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:45,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:45,998 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:45,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:46,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:46,015 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:46,018 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (1/1) ... [2019-10-15 03:00:46,023 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:46,024 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:46,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:46,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:46,026 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (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-15 03:00:46,075 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:46,076 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:46,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:46,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:46,677 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:46,677 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:46,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:46 BoogieIcfgContainer [2019-10-15 03:00:46,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:46,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:46,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:46,684 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:46,684 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:45" (1/3) ... [2019-10-15 03:00:46,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd8b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:46, skipping insertion in model container [2019-10-15 03:00:46,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:45" (2/3) ... [2019-10-15 03:00:46,686 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd8b56f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:46, skipping insertion in model container [2019-10-15 03:00:46,686 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:46" (3/3) ... [2019-10-15 03:00:46,691 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-15 03:00:46,702 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:46,713 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:46,725 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:46,759 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:46,759 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:46,760 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:46,760 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:46,760 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:46,760 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:46,761 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:46,761 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-15 03:00:46,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:46,788 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:46,789 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:46,791 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:46,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:46,797 INFO L82 PathProgramCache]: Analyzing trace with hash 1709044144, now seen corresponding path program 1 times [2019-10-15 03:00:46,804 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:46,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658776788] [2019-10-15 03:00:46,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:46,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:46,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:46,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,023 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-15 03:00:47,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658776788] [2019-10-15 03:00:47,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,026 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,026 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122931168] [2019-10-15 03:00:47,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,031 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,049 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-10-15 03:00:47,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,119 INFO L93 Difference]: Finished difference Result 78 states and 130 transitions. [2019-10-15 03:00:47,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:47,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,131 INFO L225 Difference]: With dead ends: 78 [2019-10-15 03:00:47,132 INFO L226 Difference]: Without dead ends: 63 [2019-10-15 03:00:47,135 INFO L600 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-15 03:00:47,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-15 03:00:47,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-10-15 03:00:47,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2019-10-15 03:00:47,175 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 10 [2019-10-15 03:00:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,175 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2019-10-15 03:00:47,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,176 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2019-10-15 03:00:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:47,176 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,177 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,177 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1440973320, now seen corresponding path program 1 times [2019-10-15 03:00:47,178 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,178 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996534169] [2019-10-15 03:00:47,178 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,265 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-15 03:00:47,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996534169] [2019-10-15 03:00:47,267 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,267 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,267 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56669217] [2019-10-15 03:00:47,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,269 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,270 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2019-10-15 03:00:47,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,298 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2019-10-15 03:00:47,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:47,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,300 INFO L225 Difference]: With dead ends: 63 [2019-10-15 03:00:47,301 INFO L226 Difference]: Without dead ends: 61 [2019-10-15 03:00:47,302 INFO L600 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-15 03:00:47,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-15 03:00:47,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-10-15 03:00:47,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2019-10-15 03:00:47,310 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 11 [2019-10-15 03:00:47,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,310 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2019-10-15 03:00:47,311 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,311 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2019-10-15 03:00:47,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:47,312 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,312 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,312 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1720712709, now seen corresponding path program 1 times [2019-10-15 03:00:47,313 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,313 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768513745] [2019-10-15 03:00:47,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,314 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,391 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-15 03:00:47,392 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768513745] [2019-10-15 03:00:47,392 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,393 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835748896] [2019-10-15 03:00:47,395 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,397 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 4 states. [2019-10-15 03:00:47,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,431 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2019-10-15 03:00:47,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:47,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,433 INFO L225 Difference]: With dead ends: 61 [2019-10-15 03:00:47,433 INFO L226 Difference]: Without dead ends: 59 [2019-10-15 03:00:47,434 INFO L600 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-15 03:00:47,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-15 03:00:47,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-10-15 03:00:47,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2019-10-15 03:00:47,441 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 12 [2019-10-15 03:00:47,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,442 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2019-10-15 03:00:47,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,442 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2019-10-15 03:00:47,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:47,443 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,443 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,444 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1802699517, now seen corresponding path program 1 times [2019-10-15 03:00:47,446 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,447 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374649128] [2019-10-15 03:00:47,447 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,448 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,567 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-15 03:00:47,571 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374649128] [2019-10-15 03:00:47,571 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,571 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,572 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452672937] [2019-10-15 03:00:47,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,572 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,575 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 4 states. [2019-10-15 03:00:47,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,607 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2019-10-15 03:00:47,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:47,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,609 INFO L225 Difference]: With dead ends: 59 [2019-10-15 03:00:47,609 INFO L226 Difference]: Without dead ends: 57 [2019-10-15 03:00:47,610 INFO L600 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-15 03:00:47,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-15 03:00:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2019-10-15 03:00:47,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-10-15 03:00:47,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2019-10-15 03:00:47,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,626 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-10-15 03:00:47,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,628 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-10-15 03:00:47,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:47,629 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,629 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,630 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,630 INFO L82 PathProgramCache]: Analyzing trace with hash 49323610, now seen corresponding path program 1 times [2019-10-15 03:00:47,631 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858609024] [2019-10-15 03:00:47,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,632 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,681 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-15 03:00:47,682 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858609024] [2019-10-15 03:00:47,683 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,684 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,684 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528136974] [2019-10-15 03:00:47,684 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,685 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,685 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,685 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,686 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2019-10-15 03:00:47,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,721 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-10-15 03:00:47,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,722 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:47,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,723 INFO L225 Difference]: With dead ends: 57 [2019-10-15 03:00:47,724 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:00:47,724 INFO L600 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-15 03:00:47,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:00:47,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-10-15 03:00:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2019-10-15 03:00:47,734 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 14 [2019-10-15 03:00:47,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,734 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2019-10-15 03:00:47,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,735 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2019-10-15 03:00:47,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:47,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,736 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,736 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1529245682, now seen corresponding path program 1 times [2019-10-15 03:00:47,738 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,739 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214309676] [2019-10-15 03:00:47,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,739 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:47,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214309676] [2019-10-15 03:00:47,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977291191] [2019-10-15 03:00:47,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,820 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 4 states. [2019-10-15 03:00:47,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,839 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2019-10-15 03:00:47,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:47,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,841 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:00:47,841 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:00:47,842 INFO L600 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-15 03:00:47,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:00:47,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-10-15 03:00:47,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2019-10-15 03:00:47,846 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 54 transitions. Word has length 15 [2019-10-15 03:00:47,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,847 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 54 transitions. [2019-10-15 03:00:47,847 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,847 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2019-10-15 03:00:47,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:47,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,848 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,848 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,849 INFO L82 PathProgramCache]: Analyzing trace with hash 162189999, now seen corresponding path program 1 times [2019-10-15 03:00:47,849 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,849 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899412863] [2019-10-15 03:00:47,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,849 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,850 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,900 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-15 03:00:47,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899412863] [2019-10-15 03:00:47,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266933696] [2019-10-15 03:00:47,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,902 INFO L87 Difference]: Start difference. First operand 35 states and 54 transitions. Second operand 4 states. [2019-10-15 03:00:47,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,922 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-10-15 03:00:47,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,923 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:47,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,924 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:00:47,924 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:47,924 INFO L600 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-15 03:00:47,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:47,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-10-15 03:00:47,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:47,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2019-10-15 03:00:47,929 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 16 [2019-10-15 03:00:47,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:47,929 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2019-10-15 03:00:47,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:47,929 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2019-10-15 03:00:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:47,930 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:47,930 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:47,930 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash 733137127, now seen corresponding path program 1 times [2019-10-15 03:00:47,931 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:47,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795736259] [2019-10-15 03:00:47,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,932 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:47,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:47,972 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-15 03:00:47,972 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795736259] [2019-10-15 03:00:47,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:47,973 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:47,973 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290214883] [2019-10-15 03:00:47,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:47,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:47,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:47,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:47,974 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand 4 states. [2019-10-15 03:00:47,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:47,995 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2019-10-15 03:00:47,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:47,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:47,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:47,997 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:47,997 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:47,998 INFO L600 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-15 03:00:47,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:48,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-10-15 03:00:48,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:48,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-10-15 03:00:48,002 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2019-10-15 03:00:48,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,002 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-10-15 03:00:48,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,002 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-10-15 03:00:48,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:48,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:48,003 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:48,004 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:48,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:48,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1252629252, now seen corresponding path program 1 times [2019-10-15 03:00:48,004 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:48,004 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793985418] [2019-10-15 03:00:48,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:48,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:48,041 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-15 03:00:48,041 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793985418] [2019-10-15 03:00:48,042 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:48,042 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:48,042 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971736574] [2019-10-15 03:00:48,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:48,043 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:48,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:48,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:48,044 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 4 states. [2019-10-15 03:00:48,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:48,064 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-10-15 03:00:48,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:48,064 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:48,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:48,065 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:48,065 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:48,066 INFO L600 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-15 03:00:48,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:48,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2019-10-15 03:00:48,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:48,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-10-15 03:00:48,070 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-10-15 03:00:48,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,070 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-10-15 03:00:48,070 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,070 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-10-15 03:00:48,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:48,071 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:48,071 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:48,072 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:48,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:48,072 INFO L82 PathProgramCache]: Analyzing trace with hash 177016284, now seen corresponding path program 1 times [2019-10-15 03:00:48,072 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:48,073 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903086750] [2019-10-15 03:00:48,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,073 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,073 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:48,114 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-15 03:00:48,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903086750] [2019-10-15 03:00:48,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:48,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:48,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214892891] [2019-10-15 03:00:48,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:48,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:48,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:48,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:48,121 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 4 states. [2019-10-15 03:00:48,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:48,148 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2019-10-15 03:00:48,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:48,150 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:48,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:48,151 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:48,151 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:48,151 INFO L600 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-15 03:00:48,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:48,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-10-15 03:00:48,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:48,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-10-15 03:00:48,161 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 19 [2019-10-15 03:00:48,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,161 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-10-15 03:00:48,161 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2019-10-15 03:00:48,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:00:48,162 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:48,162 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:48,162 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:48,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:48,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1192752985, now seen corresponding path program 1 times [2019-10-15 03:00:48,164 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:48,165 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124399997] [2019-10-15 03:00:48,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,165 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:48,207 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-15 03:00:48,208 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124399997] [2019-10-15 03:00:48,208 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:48,208 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:48,208 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851238153] [2019-10-15 03:00:48,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:48,209 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:48,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:48,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:48,210 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 4 states. [2019-10-15 03:00:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:48,225 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-15 03:00:48,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:48,225 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:00:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:48,226 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:48,226 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:48,226 INFO L600 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-15 03:00:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:48,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-10-15 03:00:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:48,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2019-10-15 03:00:48,230 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 20 [2019-10-15 03:00:48,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,230 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-10-15 03:00:48,230 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,230 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2019-10-15 03:00:48,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-15 03:00:48,231 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:48,231 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:48,232 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:48,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:48,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1679147311, now seen corresponding path program 1 times [2019-10-15 03:00:48,232 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:48,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825661375] [2019-10-15 03:00:48,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,233 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:48,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:48,264 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-15 03:00:48,265 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825661375] [2019-10-15 03:00:48,265 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:48,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:48,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547566401] [2019-10-15 03:00:48,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:48,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:48,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:48,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:48,267 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 4 states. [2019-10-15 03:00:48,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:48,287 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-10-15 03:00:48,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:48,288 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-15 03:00:48,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:48,289 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:48,289 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:48,290 INFO L600 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-15 03:00:48,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:48,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-10-15 03:00:48,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-15 03:00:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2019-10-15 03:00:48,293 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2019-10-15 03:00:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,293 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-10-15 03:00:48,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,293 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2019-10-15 03:00:48,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-15 03:00:48,294 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:48,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:48,295 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:48,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:48,295 INFO L82 PathProgramCache]: Analyzing trace with hash -513742930, now seen corresponding path program 1 times [2019-10-15 03:00:48,295 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:48,296 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602145643] [2019-10-15 03:00:48,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:48,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:48,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:48,330 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-15 03:00:48,330 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602145643] [2019-10-15 03:00:48,331 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:48,331 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:48,331 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944570985] [2019-10-15 03:00:48,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:48,332 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:48,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:48,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:48,332 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 4 states. [2019-10-15 03:00:48,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:48,354 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-10-15 03:00:48,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:48,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-15 03:00:48,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:48,357 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:00:48,357 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:48,358 INFO L600 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-15 03:00:48,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:48,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:48,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:48,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:48,361 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-15 03:00:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:48,361 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:48,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:48,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:48,367 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:48,396 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:48,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:48,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:48,397 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:48,397 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:48,397 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:48,397 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-15 03:00:48,398 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,399 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,400 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-10-15 03:00:48,401 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,402 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2019-10-15 03:00:48,402 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-10-15 03:00:48,402 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-15 03:00:48,402 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-10-15 03:00:48,402 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-15 03:00:48,403 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-10-15 03:00:48,413 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:48 BoogieIcfgContainer [2019-10-15 03:00:48,413 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:48,416 INFO L168 Benchmark]: Toolchain (without parser) took 2837.86 ms. Allocated memory was 138.9 MB in the beginning and 235.4 MB in the end (delta: 96.5 MB). Free memory was 104.0 MB in the beginning and 110.5 MB in the end (delta: -6.4 MB). Peak memory consumption was 90.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,417 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,418 INFO L168 Benchmark]: CACSL2BoogieTranslator took 402.59 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 182.2 MB in the end (delta: -78.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,419 INFO L168 Benchmark]: Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 179.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,419 INFO L168 Benchmark]: RCFGBuilder took 654.66 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 137.5 MB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,420 INFO L168 Benchmark]: TraceAbstraction took 1733.27 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 137.5 MB in the beginning and 110.5 MB in the end (delta: 27.1 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:48,424 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 122.2 MB in the beginning and 122.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 402.59 ms. Allocated memory was 138.9 MB in the beginning and 202.9 MB in the end (delta: 64.0 MB). Free memory was 103.8 MB in the beginning and 182.2 MB in the end (delta: -78.4 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.78 ms. Allocated memory is still 202.9 MB. Free memory was 182.2 MB in the beginning and 179.8 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 654.66 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 137.5 MB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1733.27 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 137.5 MB in the beginning and 110.5 MB in the end (delta: 27.1 MB). Peak memory consumption was 59.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: 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: 48]: 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, 40 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 671 SDtfs, 522 SDslu, 969 SDs, 0 SdLazy, 117 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred 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.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 204 StatesRemovedByMinimization, 12 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, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 12779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...