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-f4eb214f-m [2019-10-13 22:57:10,759 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 22:57:10,763 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 22:57:10,783 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 22:57:10,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 22:57:10,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 22:57:10,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 22:57:10,800 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 22:57:10,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 22:57:10,804 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 22:57:10,806 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 22:57:10,807 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 22:57:10,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 22:57:10,811 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 22:57:10,814 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 22:57:10,815 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 22:57:10,817 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 22:57:10,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 22:57:10,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 22:57:10,828 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 22:57:10,831 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 22:57:10,832 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 22:57:10,835 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 22:57:10,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 22:57:10,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 22:57:10,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 22:57:10,839 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 22:57:10,841 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 22:57:10,842 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 22:57:10,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 22:57:10,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 22:57:10,846 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 22:57:10,847 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 22:57:10,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 22:57:10,849 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 22:57:10,849 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 22:57:10,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 22:57:10,850 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 22:57:10,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 22:57:10,853 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 22:57:10,856 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 22:57:10,857 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 22:57:10,876 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 22:57:10,876 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 22:57:10,878 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 22:57:10,878 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 22:57:10,879 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 22:57:10,879 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 22:57:10,879 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 22:57:10,879 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 22:57:10,879 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 22:57:10,880 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 22:57:10,881 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 22:57:10,881 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 22:57:10,881 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 22:57:10,882 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 22:57:10,882 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 22:57:10,882 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 22:57:10,882 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 22:57:10,882 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 22:57:10,883 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 22:57:10,883 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 22:57:10,883 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 22:57:10,883 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:10,883 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 22:57:10,884 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 22:57:10,884 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 22:57:10,884 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 22:57:10,884 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 22:57:10,884 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 22:57:10,885 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-13 22:57:11,156 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 22:57:11,175 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 22:57:11,179 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 22:57:11,181 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 22:57:11,181 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 22:57:11,182 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-13 22:57:11,245 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0883666/e8bfe3b3eafe40e89b1c9481d1d7689a/FLAGc1e709976 [2019-10-13 22:57:11,749 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 22:57:11,751 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-10-13 22:57:11,762 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0883666/e8bfe3b3eafe40e89b1c9481d1d7689a/FLAGc1e709976 [2019-10-13 22:57:12,106 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d0883666/e8bfe3b3eafe40e89b1c9481d1d7689a [2019-10-13 22:57:12,117 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 22:57:12,119 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 22:57:12,121 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:12,121 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 22:57:12,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 22:57:12,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,129 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@760969a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12, skipping insertion in model container [2019-10-13 22:57:12,130 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,140 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 22:57:12,182 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 22:57:12,430 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:12,434 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 22:57:12,545 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 22:57:12,562 INFO L192 MainTranslator]: Completed translation [2019-10-13 22:57:12,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12 WrapperNode [2019-10-13 22:57:12,564 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 22:57:12,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 22:57:12,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 22:57:12,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 22:57:12,576 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,577 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,582 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,583 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... [2019-10-13 22:57:12,603 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 22:57:12,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 22:57:12,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 22:57:12,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 22:57:12,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 22:57:12,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 22:57:12,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 22:57:12,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 22:57:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 22:57:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 22:57:12,670 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 22:57:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 22:57:12,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 22:57:13,320 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 22:57:13,321 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-13 22:57:13,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:13 BoogieIcfgContainer [2019-10-13 22:57:13,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 22:57:13,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 22:57:13,326 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 22:57:13,329 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 22:57:13,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 10:57:12" (1/3) ... [2019-10-13 22:57:13,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19608c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:13, skipping insertion in model container [2019-10-13 22:57:13,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 10:57:12" (2/3) ... [2019-10-13 22:57:13,331 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c19608c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 10:57:13, skipping insertion in model container [2019-10-13 22:57:13,331 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 10:57:13" (3/3) ... [2019-10-13 22:57:13,333 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-10-13 22:57:13,341 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 22:57:13,350 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 22:57:13,361 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 22:57:13,384 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 22:57:13,384 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 22:57:13,384 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 22:57:13,384 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 22:57:13,385 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 22:57:13,385 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 22:57:13,385 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 22:57:13,385 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 22:57:13,401 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-10-13 22:57:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 22:57:13,406 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:13,407 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:13,409 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:13,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:13,415 INFO L82 PathProgramCache]: Analyzing trace with hash 1709044144, now seen corresponding path program 1 times [2019-10-13 22:57:13,425 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:13,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961622820] [2019-10-13 22:57:13,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:13,426 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:13,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:13,624 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961622820] [2019-10-13 22:57:13,625 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:13,626 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:13,627 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563881888] [2019-10-13 22:57:13,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:13,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:13,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:13,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:13,646 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-10-13 22:57:13,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:13,730 INFO L93 Difference]: Finished difference Result 78 states and 130 transitions. [2019-10-13 22:57:13,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:13,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-13 22:57:13,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:13,752 INFO L225 Difference]: With dead ends: 78 [2019-10-13 22:57:13,753 INFO L226 Difference]: Without dead ends: 63 [2019-10-13 22:57:13,758 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-13 22:57:13,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-10-13 22:57:13,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-10-13 22:57:13,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:13,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2019-10-13 22:57:13,828 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 10 [2019-10-13 22:57:13,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:13,829 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2019-10-13 22:57:13,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:13,829 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2019-10-13 22:57:13,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 22:57:13,831 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:13,831 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:13,832 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:13,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:13,834 INFO L82 PathProgramCache]: Analyzing trace with hash 1440973320, now seen corresponding path program 1 times [2019-10-13 22:57:13,834 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:13,834 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724430774] [2019-10-13 22:57:13,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:13,835 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:13,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:13,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:13,960 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724430774] [2019-10-13 22:57:13,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:13,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:13,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193009380] [2019-10-13 22:57:13,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:13,965 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:13,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:13,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:13,966 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2019-10-13 22:57:14,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,013 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2019-10-13 22:57:14,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 22:57:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,015 INFO L225 Difference]: With dead ends: 63 [2019-10-13 22:57:14,015 INFO L226 Difference]: Without dead ends: 61 [2019-10-13 22:57:14,016 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-13 22:57:14,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-13 22:57:14,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-10-13 22:57:14,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2019-10-13 22:57:14,024 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 11 [2019-10-13 22:57:14,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,024 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2019-10-13 22:57:14,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2019-10-13 22:57:14,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-13 22:57:14,026 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,027 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1720712709, now seen corresponding path program 1 times [2019-10-13 22:57:14,028 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671946205] [2019-10-13 22:57:14,028 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,029 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,116 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671946205] [2019-10-13 22:57:14,117 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,117 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,118 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1872608349] [2019-10-13 22:57:14,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,119 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,120 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 4 states. [2019-10-13 22:57:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,162 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2019-10-13 22:57:14,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,164 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-13 22:57:14,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,165 INFO L225 Difference]: With dead ends: 61 [2019-10-13 22:57:14,165 INFO L226 Difference]: Without dead ends: 59 [2019-10-13 22:57:14,166 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-13 22:57:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-13 22:57:14,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-10-13 22:57:14,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2019-10-13 22:57:14,182 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 12 [2019-10-13 22:57:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,182 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2019-10-13 22:57:14,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,182 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2019-10-13 22:57:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-13 22:57:14,183 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,183 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,184 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,184 INFO L82 PathProgramCache]: Analyzing trace with hash 1802699517, now seen corresponding path program 1 times [2019-10-13 22:57:14,185 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,185 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432034618] [2019-10-13 22:57:14,185 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,186 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,253 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432034618] [2019-10-13 22:57:14,254 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,254 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,257 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538976805] [2019-10-13 22:57:14,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,258 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,258 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 4 states. [2019-10-13 22:57:14,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,288 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2019-10-13 22:57:14,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,289 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-13 22:57:14,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,290 INFO L225 Difference]: With dead ends: 59 [2019-10-13 22:57:14,290 INFO L226 Difference]: Without dead ends: 57 [2019-10-13 22:57:14,291 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-13 22:57:14,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-10-13 22:57:14,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2019-10-13 22:57:14,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-10-13 22:57:14,300 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2019-10-13 22:57:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,300 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-10-13 22:57:14,300 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-10-13 22:57:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 22:57:14,301 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,301 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,302 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,302 INFO L82 PathProgramCache]: Analyzing trace with hash 49323610, now seen corresponding path program 1 times [2019-10-13 22:57:14,302 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,303 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320682117] [2019-10-13 22:57:14,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,303 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,303 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320682117] [2019-10-13 22:57:14,342 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,342 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,342 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479989135] [2019-10-13 22:57:14,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,343 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,344 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2019-10-13 22:57:14,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,369 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-10-13 22:57:14,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,370 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-13 22:57:14,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,371 INFO L225 Difference]: With dead ends: 57 [2019-10-13 22:57:14,371 INFO L226 Difference]: Without dead ends: 55 [2019-10-13 22:57:14,372 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-13 22:57:14,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-13 22:57:14,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-10-13 22:57:14,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2019-10-13 22:57:14,377 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 14 [2019-10-13 22:57:14,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,377 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2019-10-13 22:57:14,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,378 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2019-10-13 22:57:14,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-13 22:57:14,378 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,379 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,379 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1529245682, now seen corresponding path program 1 times [2019-10-13 22:57:14,380 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,380 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858305013] [2019-10-13 22:57:14,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,380 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1858305013] [2019-10-13 22:57:14,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748313657] [2019-10-13 22:57:14,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,425 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 4 states. [2019-10-13 22:57:14,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,445 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2019-10-13 22:57:14,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,446 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-13 22:57:14,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,447 INFO L225 Difference]: With dead ends: 55 [2019-10-13 22:57:14,447 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 22:57:14,448 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-13 22:57:14,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 22:57:14,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-10-13 22:57:14,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2019-10-13 22:57:14,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 54 transitions. Word has length 15 [2019-10-13 22:57:14,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,453 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 54 transitions. [2019-10-13 22:57:14,453 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,454 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2019-10-13 22:57:14,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-13 22:57:14,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,454 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,455 INFO L82 PathProgramCache]: Analyzing trace with hash 162189999, now seen corresponding path program 1 times [2019-10-13 22:57:14,455 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,456 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200591168] [2019-10-13 22:57:14,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,456 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,515 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200591168] [2019-10-13 22:57:14,515 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,516 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,516 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499450628] [2019-10-13 22:57:14,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,517 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,517 INFO L87 Difference]: Start difference. First operand 35 states and 54 transitions. Second operand 4 states. [2019-10-13 22:57:14,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,550 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-10-13 22:57:14,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-13 22:57:14,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,552 INFO L225 Difference]: With dead ends: 53 [2019-10-13 22:57:14,552 INFO L226 Difference]: Without dead ends: 51 [2019-10-13 22:57:14,553 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-13 22:57:14,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-13 22:57:14,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-10-13 22:57:14,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2019-10-13 22:57:14,561 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 16 [2019-10-13 22:57:14,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,562 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2019-10-13 22:57:14,562 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,562 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2019-10-13 22:57:14,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 22:57:14,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 22:57:14,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,568 INFO L82 PathProgramCache]: Analyzing trace with hash 733137127, now seen corresponding path program 1 times [2019-10-13 22:57:14,568 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400967867] [2019-10-13 22:57:14,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,569 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,623 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400967867] [2019-10-13 22:57:14,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887154144] [2019-10-13 22:57:14,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,625 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand 4 states. [2019-10-13 22:57:14,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,646 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2019-10-13 22:57:14,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,646 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-13 22:57:14,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,647 INFO L225 Difference]: With dead ends: 51 [2019-10-13 22:57:14,647 INFO L226 Difference]: Without dead ends: 49 [2019-10-13 22:57:14,648 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-13 22:57:14,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-13 22:57:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-10-13 22:57:14,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-10-13 22:57:14,654 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2019-10-13 22:57:14,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,654 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-10-13 22:57:14,654 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,654 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-10-13 22:57:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-13 22:57:14,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,656 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-13 22:57:14,656 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,657 INFO L82 PathProgramCache]: Analyzing trace with hash 1252629252, now seen corresponding path program 1 times [2019-10-13 22:57:14,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52965263] [2019-10-13 22:57:14,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,658 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,714 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52965263] [2019-10-13 22:57:14,714 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144419627] [2019-10-13 22:57:14,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,715 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,716 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 4 states. [2019-10-13 22:57:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,733 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-10-13 22:57:14,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,734 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-13 22:57:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,735 INFO L225 Difference]: With dead ends: 49 [2019-10-13 22:57:14,735 INFO L226 Difference]: Without dead ends: 47 [2019-10-13 22:57:14,736 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-13 22:57:14,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-13 22:57:14,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2019-10-13 22:57:14,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-10-13 22:57:14,739 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-10-13 22:57:14,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,739 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-10-13 22:57:14,740 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,740 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-10-13 22:57:14,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-13 22:57:14,740 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,741 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-13 22:57:14,741 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,741 INFO L82 PathProgramCache]: Analyzing trace with hash 177016284, now seen corresponding path program 1 times [2019-10-13 22:57:14,742 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,743 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988399483] [2019-10-13 22:57:14,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,744 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,782 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988399483] [2019-10-13 22:57:14,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583729149] [2019-10-13 22:57:14,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,784 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 4 states. [2019-10-13 22:57:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,802 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2019-10-13 22:57:14,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-13 22:57:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,804 INFO L225 Difference]: With dead ends: 47 [2019-10-13 22:57:14,804 INFO L226 Difference]: Without dead ends: 45 [2019-10-13 22:57:14,804 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-13 22:57:14,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-13 22:57:14,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-10-13 22:57:14,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-10-13 22:57:14,808 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 19 [2019-10-13 22:57:14,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,808 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-10-13 22:57:14,808 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,809 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2019-10-13 22:57:14,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-13 22:57:14,809 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,809 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-13 22:57:14,810 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1192752985, now seen corresponding path program 1 times [2019-10-13 22:57:14,810 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,811 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685519526] [2019-10-13 22:57:14,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,811 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,838 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685519526] [2019-10-13 22:57:14,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662163714] [2019-10-13 22:57:14,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,840 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 4 states. [2019-10-13 22:57:14,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,857 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-10-13 22:57:14,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,858 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-13 22:57:14,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,858 INFO L225 Difference]: With dead ends: 45 [2019-10-13 22:57:14,858 INFO L226 Difference]: Without dead ends: 43 [2019-10-13 22:57:14,859 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-13 22:57:14,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-13 22:57:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-10-13 22:57:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2019-10-13 22:57:14,862 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 20 [2019-10-13 22:57:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,863 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-10-13 22:57:14,863 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2019-10-13 22:57:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-13 22:57:14,864 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,864 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-13 22:57:14,864 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1679147311, now seen corresponding path program 1 times [2019-10-13 22:57:14,865 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460687364] [2019-10-13 22:57:14,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,893 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460687364] [2019-10-13 22:57:14,893 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,893 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,894 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682877382] [2019-10-13 22:57:14,894 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,894 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,895 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 4 states. [2019-10-13 22:57:14,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,912 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-10-13 22:57:14,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,913 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-10-13 22:57:14,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,914 INFO L225 Difference]: With dead ends: 43 [2019-10-13 22:57:14,914 INFO L226 Difference]: Without dead ends: 41 [2019-10-13 22:57:14,915 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-13 22:57:14,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-13 22:57:14,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-10-13 22:57:14,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-13 22:57:14,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2019-10-13 22:57:14,918 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2019-10-13 22:57:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,919 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-10-13 22:57:14,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,919 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2019-10-13 22:57:14,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-13 22:57:14,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 22:57:14,920 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-13 22:57:14,921 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 22:57:14,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 22:57:14,921 INFO L82 PathProgramCache]: Analyzing trace with hash -513742930, now seen corresponding path program 1 times [2019-10-13 22:57:14,922 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-13 22:57:14,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178415137] [2019-10-13 22:57:14,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,923 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 22:57:14,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 22:57:14,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 22:57:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 22:57:14,964 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178415137] [2019-10-13 22:57:14,964 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 22:57:14,965 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 22:57:14,965 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817561377] [2019-10-13 22:57:14,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 22:57:14,966 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-13 22:57:14,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 22:57:14,966 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-13 22:57:14,966 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 4 states. [2019-10-13 22:57:14,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 22:57:14,989 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-10-13 22:57:14,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 22:57:14,990 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-10-13 22:57:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 22:57:14,991 INFO L225 Difference]: With dead ends: 37 [2019-10-13 22:57:14,991 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 22:57:14,991 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-13 22:57:14,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 22:57:14,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 22:57:14,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 22:57:14,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 22:57:14,993 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-13 22:57:14,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 22:57:14,993 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 22:57:14,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 22:57:14,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 22:57:14,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 22:57:14,999 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 22:57:15,020 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-13 22:57:15,020 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:57:15,020 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 22:57:15,020 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 22:57:15,021 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 22:57:15,021 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 22:57:15,021 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2019-10-13 22:57:15,021 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-10-13 22:57:15,021 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-10-13 22:57:15,021 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,022 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,023 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,024 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-10-13 22:57:15,025 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,025 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2019-10-13 22:57:15,025 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-10-13 22:57:15,025 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-10-13 22:57:15,025 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-10-13 22:57:15,025 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,026 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-10-13 22:57:15,026 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,026 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-10-13 22:57:15,026 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-10-13 22:57:15,026 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-10-13 22:57:15,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 10:57:15 BoogieIcfgContainer [2019-10-13 22:57:15,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 22:57:15,041 INFO L168 Benchmark]: Toolchain (without parser) took 2920.52 ms. Allocated memory was 139.5 MB in the beginning and 233.8 MB in the end (delta: 94.4 MB). Free memory was 104.4 MB in the beginning and 106.1 MB in the end (delta: -1.7 MB). Peak memory consumption was 92.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,042 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,043 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.30 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 104.2 MB in the beginning and 182.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,044 INFO L168 Benchmark]: Boogie Preprocessor took 38.15 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,044 INFO L168 Benchmark]: RCFGBuilder took 719.58 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 137.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,045 INFO L168 Benchmark]: TraceAbstraction took 1713.73 ms. Allocated memory was 203.4 MB in the beginning and 233.8 MB in the end (delta: 30.4 MB). Free memory was 137.6 MB in the beginning and 106.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 61.9 MB. Max. memory is 7.1 GB. [2019-10-13 22:57:15,049 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.23 ms. Allocated memory is still 139.5 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 443.30 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 104.2 MB in the beginning and 182.1 MB in the end (delta: -77.9 MB). Peak memory consumption was 24.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.15 ms. Allocated memory is still 203.4 MB. Free memory was 182.1 MB in the beginning and 180.3 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 719.58 ms. Allocated memory is still 203.4 MB. Free memory was 179.7 MB in the beginning and 137.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1713.73 ms. Allocated memory was 203.4 MB in the beginning and 233.8 MB in the end (delta: 30.4 MB). Free memory was 137.6 MB in the beginning and 106.1 MB in the end (delta: 31.5 MB). Peak memory consumption was 61.9 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.1s 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...