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_10.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:28:21,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:28:21,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:28:21,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:28:21,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:28:21,969 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:28:21,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:28:21,981 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:28:21,983 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:28:21,984 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:28:21,986 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:28:21,987 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:28:21,988 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:28:21,991 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:28:21,994 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:28:21,997 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:28:21,998 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:28:22,002 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:28:22,004 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:28:22,010 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:28:22,014 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:28:22,017 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:28:22,020 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:28:22,021 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:28:22,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:28:22,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:28:22,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:28:22,027 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:28:22,029 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:28:22,030 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:28:22,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:28:22,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:28:22,032 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:28:22,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:28:22,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:28:22,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:28:22,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:28:22,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:28:22,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:28:22,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:28:22,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:28:22,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:28:22,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:28:22,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:28:22,081 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:28:22,082 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:28:22,082 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:28:22,082 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:28:22,082 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:28:22,082 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:28:22,082 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:28:22,083 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:28:22,083 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:28:22,083 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:28:22,083 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:28:22,083 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:28:22,084 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:28:22,084 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:28:22,084 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:28:22,084 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:28:22,085 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:28:22,085 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:28:22,085 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:28:22,085 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:22,085 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:28:22,086 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:28:22,086 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:28:22,086 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:28:22,086 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:28:22,087 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:28:22,087 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:28:22,381 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:28:22,394 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:28:22,398 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:28:22,400 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:28:22,400 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:28:22,401 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_10.c [2019-10-07 13:28:22,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dac25ed7/ce718835604346cf851cd31bff31fca1/FLAGba48ac527 [2019-10-07 13:28:22,942 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:28:22,942 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_10.c [2019-10-07 13:28:22,953 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dac25ed7/ce718835604346cf851cd31bff31fca1/FLAGba48ac527 [2019-10-07 13:28:23,275 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1dac25ed7/ce718835604346cf851cd31bff31fca1 [2019-10-07 13:28:23,286 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:28:23,288 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:28:23,293 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:23,294 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:28:23,297 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:28:23,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b57f279 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23, skipping insertion in model container [2019-10-07 13:28:23,302 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,310 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:28:23,343 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:28:23,561 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:23,568 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:28:23,592 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:28:23,692 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:28:23,693 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23 WrapperNode [2019-10-07 13:28:23,693 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:28:23,694 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:28:23,694 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:28:23,694 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:28:23,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... [2019-10-07 13:28:23,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:28:23,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:28:23,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:28:23,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:28:23,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:28:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:28:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:28:23,797 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:28:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:28:23,797 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-07 13:28:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:28:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:28:23,798 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:28:24,383 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:28:24,383 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-07 13:28:24,388 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:24 BoogieIcfgContainer [2019-10-07 13:28:24,388 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:28:24,389 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:28:24,390 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:28:24,395 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:28:24,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:28:23" (1/3) ... [2019-10-07 13:28:24,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22072a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:24, skipping insertion in model container [2019-10-07 13:28:24,397 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:28:23" (2/3) ... [2019-10-07 13:28:24,397 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22072a5c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:28:24, skipping insertion in model container [2019-10-07 13:28:24,398 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:28:24" (3/3) ... [2019-10-07 13:28:24,408 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_10.c [2019-10-07 13:28:24,419 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:28:24,428 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-07 13:28:24,440 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-07 13:28:24,468 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:28:24,468 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:28:24,469 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:28:24,469 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:28:24,469 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:28:24,469 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:28:24,470 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:28:24,470 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:28:24,487 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states. [2019-10-07 13:28:24,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-07 13:28:24,492 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:24,493 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:24,494 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:24,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:24,499 INFO L82 PathProgramCache]: Analyzing trace with hash 2137553673, now seen corresponding path program 1 times [2019-10-07 13:28:24,506 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:24,507 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,507 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,507 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:24,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:24,714 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,715 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:24,716 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:24,720 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:24,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:24,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:24,736 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 4 states. [2019-10-07 13:28:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:24,805 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2019-10-07 13:28:24,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:24,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-07 13:28:24,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:24,822 INFO L225 Difference]: With dead ends: 66 [2019-10-07 13:28:24,822 INFO L226 Difference]: Without dead ends: 51 [2019-10-07 13:28:24,826 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-07 13:28:24,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 29. [2019-10-07 13:28:24,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:24,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 47 transitions. [2019-10-07 13:28:24,874 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 47 transitions. Word has length 10 [2019-10-07 13:28:24,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:24,874 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 47 transitions. [2019-10-07 13:28:24,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 47 transitions. [2019-10-07 13:28:24,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-07 13:28:24,876 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:24,876 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:24,876 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:24,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:24,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1839867803, now seen corresponding path program 1 times [2019-10-07 13:28:24,877 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:24,877 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,878 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,878 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:24,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:24,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:24,938 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,938 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:24,938 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:24,940 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:24,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:24,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:24,941 INFO L87 Difference]: Start difference. First operand 29 states and 47 transitions. Second operand 4 states. [2019-10-07 13:28:24,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:24,970 INFO L93 Difference]: Finished difference Result 51 states and 83 transitions. [2019-10-07 13:28:24,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:24,971 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-07 13:28:24,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:24,972 INFO L225 Difference]: With dead ends: 51 [2019-10-07 13:28:24,973 INFO L226 Difference]: Without dead ends: 49 [2019-10-07 13:28:24,974 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:24,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-07 13:28:24,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 29. [2019-10-07 13:28:24,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:24,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 46 transitions. [2019-10-07 13:28:24,981 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 46 transitions. Word has length 11 [2019-10-07 13:28:24,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:24,981 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 46 transitions. [2019-10-07 13:28:24,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:24,982 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 46 transitions. [2019-10-07 13:28:24,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:28:24,982 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:24,983 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:24,983 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:24,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:24,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1201540766, now seen corresponding path program 1 times [2019-10-07 13:28:24,984 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:24,984 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:24,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,984 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,046 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,046 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,046 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,048 INFO L87 Difference]: Start difference. First operand 29 states and 46 transitions. Second operand 4 states. [2019-10-07 13:28:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,077 INFO L93 Difference]: Finished difference Result 49 states and 78 transitions. [2019-10-07 13:28:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-07 13:28:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,079 INFO L225 Difference]: With dead ends: 49 [2019-10-07 13:28:25,079 INFO L226 Difference]: Without dead ends: 47 [2019-10-07 13:28:25,080 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-07 13:28:25,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2019-10-07 13:28:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 45 transitions. [2019-10-07 13:28:25,086 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 45 transitions. Word has length 12 [2019-10-07 13:28:25,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,087 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 45 transitions. [2019-10-07 13:28:25,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,087 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 45 transitions. [2019-10-07 13:28:25,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:28:25,088 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,088 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,089 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1406727856, now seen corresponding path program 1 times [2019-10-07 13:28:25,090 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,090 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,090 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,159 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,159 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,160 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,161 INFO L87 Difference]: Start difference. First operand 29 states and 45 transitions. Second operand 4 states. [2019-10-07 13:28:25,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,193 INFO L93 Difference]: Finished difference Result 47 states and 73 transitions. [2019-10-07 13:28:25,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:28:25,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,195 INFO L225 Difference]: With dead ends: 47 [2019-10-07 13:28:25,195 INFO L226 Difference]: Without dead ends: 45 [2019-10-07 13:28:25,196 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-07 13:28:25,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 29. [2019-10-07 13:28:25,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 44 transitions. [2019-10-07 13:28:25,202 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 44 transitions. Word has length 13 [2019-10-07 13:28:25,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,203 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 44 transitions. [2019-10-07 13:28:25,203 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,203 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 44 transitions. [2019-10-07 13:28:25,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:28:25,204 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,204 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,204 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,205 INFO L82 PathProgramCache]: Analyzing trace with hash -658676173, now seen corresponding path program 1 times [2019-10-07 13:28:25,205 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,205 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,206 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,292 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,293 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,293 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,294 INFO L87 Difference]: Start difference. First operand 29 states and 44 transitions. Second operand 4 states. [2019-10-07 13:28:25,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,318 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2019-10-07 13:28:25,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,318 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-07 13:28:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,319 INFO L225 Difference]: With dead ends: 45 [2019-10-07 13:28:25,320 INFO L226 Difference]: Without dead ends: 43 [2019-10-07 13:28:25,320 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-07 13:28:25,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 29. [2019-10-07 13:28:25,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 43 transitions. [2019-10-07 13:28:25,325 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 43 transitions. Word has length 14 [2019-10-07 13:28:25,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,325 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 43 transitions. [2019-10-07 13:28:25,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,326 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 43 transitions. [2019-10-07 13:28:25,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-07 13:28:25,326 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,327 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,327 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,327 INFO L82 PathProgramCache]: Analyzing trace with hash 1056089861, now seen corresponding path program 1 times [2019-10-07 13:28:25,328 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,328 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,328 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,372 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,372 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,373 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,373 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,374 INFO L87 Difference]: Start difference. First operand 29 states and 43 transitions. Second operand 4 states. [2019-10-07 13:28:25,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,396 INFO L93 Difference]: Finished difference Result 43 states and 63 transitions. [2019-10-07 13:28:25,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,399 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-07 13:28:25,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,400 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:28:25,400 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:28:25,401 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:28:25,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2019-10-07 13:28:25,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 42 transitions. [2019-10-07 13:28:25,409 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 42 transitions. Word has length 15 [2019-10-07 13:28:25,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,410 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 42 transitions. [2019-10-07 13:28:25,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,410 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 42 transitions. [2019-10-07 13:28:25,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-07 13:28:25,412 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,412 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1620737592, now seen corresponding path program 1 times [2019-10-07 13:28:25,413 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,414 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,414 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,502 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,502 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,502 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,504 INFO L87 Difference]: Start difference. First operand 29 states and 42 transitions. Second operand 4 states. [2019-10-07 13:28:25,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,538 INFO L93 Difference]: Finished difference Result 41 states and 58 transitions. [2019-10-07 13:28:25,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,539 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-07 13:28:25,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,540 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:28:25,540 INFO L226 Difference]: Without dead ends: 39 [2019-10-07 13:28:25,540 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-07 13:28:25,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 29. [2019-10-07 13:28:25,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2019-10-07 13:28:25,548 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 16 [2019-10-07 13:28:25,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,548 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2019-10-07 13:28:25,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,550 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2019-10-07 13:28:25,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-07 13:28:25,551 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,552 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,552 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1296957626, now seen corresponding path program 1 times [2019-10-07 13:28:25,553 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,553 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,553 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,629 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,629 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,630 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,631 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand 4 states. [2019-10-07 13:28:25,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,661 INFO L93 Difference]: Finished difference Result 39 states and 53 transitions. [2019-10-07 13:28:25,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,661 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-07 13:28:25,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,662 INFO L225 Difference]: With dead ends: 39 [2019-10-07 13:28:25,662 INFO L226 Difference]: Without dead ends: 37 [2019-10-07 13:28:25,663 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-07 13:28:25,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 29. [2019-10-07 13:28:25,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-07 13:28:25,669 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 17 [2019-10-07 13:28:25,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,669 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-07 13:28:25,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,669 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-07 13:28:25,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-07 13:28:25,671 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,671 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,671 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1551196509, now seen corresponding path program 1 times [2019-10-07 13:28:25,672 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,672 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,672 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,672 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,737 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,738 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,738 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,740 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-10-07 13:28:25,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,772 INFO L93 Difference]: Finished difference Result 37 states and 48 transitions. [2019-10-07 13:28:25,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,773 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-07 13:28:25,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,774 INFO L225 Difference]: With dead ends: 37 [2019-10-07 13:28:25,774 INFO L226 Difference]: Without dead ends: 35 [2019-10-07 13:28:25,774 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-07 13:28:25,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 29. [2019-10-07 13:28:25,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:28:25,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 39 transitions. [2019-10-07 13:28:25,783 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 39 transitions. Word has length 18 [2019-10-07 13:28:25,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,786 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 39 transitions. [2019-10-07 13:28:25,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 39 transitions. [2019-10-07 13:28:25,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:28:25,787 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:28:25,787 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:28:25,787 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:28:25,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:28:25,788 INFO L82 PathProgramCache]: Analyzing trace with hash 842667631, now seen corresponding path program 1 times [2019-10-07 13:28:25,788 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:28:25,788 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,788 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:28:25,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:28:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:28:25,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:28:25,851 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:28:25,852 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:28:25,853 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:28:25,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:28:25,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:28:25,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,854 INFO L87 Difference]: Start difference. First operand 29 states and 39 transitions. Second operand 4 states. [2019-10-07 13:28:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:28:25,875 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2019-10-07 13:28:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-07 13:28:25,876 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-07 13:28:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:28:25,877 INFO L225 Difference]: With dead ends: 31 [2019-10-07 13:28:25,877 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:28:25,877 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:28:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:28:25,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:28:25,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:28:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:28:25,881 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-10-07 13:28:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:28:25,882 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:28:25,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:28:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:28:25,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:28:25,889 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:28:25,906 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-07 13:28:25,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:25,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:28:25,907 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-07 13:28:25,907 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:28:25,907 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:28:25,907 INFO L446 ceAbstractionStarter]: At program point L159(lines 5 163) the Hoare annotation is: true [2019-10-07 13:28:25,907 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 163) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L118-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L143-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L102-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L119(line 119) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L443 ceAbstractionStarter]: For program point L128-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,908 INFO L446 ceAbstractionStarter]: At program point L153-1(lines 39 158) the Hoare annotation is: true [2019-10-07 13:28:25,909 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 163) no Hoare annotation was computed. [2019-10-07 13:28:25,909 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 161) no Hoare annotation was computed. [2019-10-07 13:28:25,909 INFO L443 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2019-10-07 13:28:25,909 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 163) the Hoare annotation is: true [2019-10-07 13:28:25,909 INFO L443 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L439 ceAbstractionStarter]: At program point L154-1(lines 5 163) the Hoare annotation is: false [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L113-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L138-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L123-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L148-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,910 INFO L443 ceAbstractionStarter]: For program point L41(lines 41 43) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L149(line 149) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L108-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L133-1(lines 39 158) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-10-07 13:28:25,911 INFO L443 ceAbstractionStarter]: For program point L134(line 134) no Hoare annotation was computed. [2019-10-07 13:28:25,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:28:25 BoogieIcfgContainer [2019-10-07 13:28:25,920 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:28:25,923 INFO L168 Benchmark]: Toolchain (without parser) took 2633.83 ms. Allocated memory was 146.3 MB in the beginning and 233.8 MB in the end (delta: 87.6 MB). Free memory was 104.2 MB in the beginning and 150.0 MB in the end (delta: -45.9 MB). Peak memory consumption was 41.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,924 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,925 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.23 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 104.0 MB in the beginning and 183.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,925 INFO L168 Benchmark]: Boogie Preprocessor took 43.50 ms. Allocated memory is still 204.5 MB. Free memory was 183.5 MB in the beginning and 181.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,926 INFO L168 Benchmark]: RCFGBuilder took 650.63 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 146.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,927 INFO L168 Benchmark]: TraceAbstraction took 1530.61 ms. Allocated memory was 204.5 MB in the beginning and 233.8 MB in the end (delta: 29.4 MB). Free memory was 145.7 MB in the beginning and 150.0 MB in the end (delta: -4.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. [2019-10-07 13:28:25,931 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 146.3 MB. Free memory was 122.7 MB in the beginning and 122.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 400.23 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 104.0 MB in the beginning and 183.5 MB in the end (delta: -79.5 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.50 ms. Allocated memory is still 204.5 MB. Free memory was 183.5 MB in the beginning and 181.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 650.63 ms. Allocated memory is still 204.5 MB. Free memory was 181.1 MB in the beginning and 146.4 MB in the end (delta: 34.7 MB). Peak memory consumption was 34.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1530.61 ms. Allocated memory was 204.5 MB in the beginning and 233.8 MB in the end (delta: 29.4 MB). Free memory was 145.7 MB in the beginning and 150.0 MB in the end (delta: -4.3 MB). Peak memory consumption was 25.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 161]: 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: 39]: 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, 34 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 10, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 413 SDtfs, 312 SDslu, 592 SDs, 0 SdLazy, 94 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred 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, 10 MinimizatonAttempts, 126 StatesRemovedByMinimization, 9 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.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 145 NumberOfCodeBlocks, 145 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 135 ConstructedInterpolants, 0 QuantifiedInterpolants, 7125 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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...