/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_11.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:58:08,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:58:08,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:58:08,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:58:08,656 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:58:08,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:58:08,658 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:58:08,660 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:58:08,662 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:58:08,663 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:58:08,664 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:58:08,669 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:58:08,670 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:58:08,671 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:58:08,672 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:58:08,673 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:58:08,674 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:58:08,674 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:58:08,676 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:58:08,679 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:58:08,683 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:58:08,686 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:58:08,687 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:58:08,688 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:58:08,690 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:58:08,691 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:58:08,691 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:58:08,694 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:58:08,695 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:58:08,696 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:58:08,696 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:58:08,700 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:58:08,702 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:58:08,703 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:58:08,707 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:58:08,707 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:58:08,708 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:58:08,708 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:58:08,708 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:58:08,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:58:08,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:58:08,713 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 03:58:08,738 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:58:08,738 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:58:08,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:58:08,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:58:08,741 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:58:08,741 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:58:08,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:58:08,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:58:08,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:58:08,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:58:08,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:58:08,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:58:08,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:58:08,744 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:58:08,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:58:08,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:58:08,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:58:08,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:58:08,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:58:08,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:58:08,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:58:08,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:08,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:58:08,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:58:08,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:58:08,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:58:08,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:58:08,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:58:08,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 03:58:09,087 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:58:09,107 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:58:09,110 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:58:09,112 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:58:09,112 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:58:09,113 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-11-07 03:58:09,190 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48d269e/9b1eb68ebb2641c89ac205e953f045cf/FLAGfd92fa122 [2019-11-07 03:58:09,711 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:58:09,712 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-11-07 03:58:09,726 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48d269e/9b1eb68ebb2641c89ac205e953f045cf/FLAGfd92fa122 [2019-11-07 03:58:10,130 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c48d269e/9b1eb68ebb2641c89ac205e953f045cf [2019-11-07 03:58:10,153 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:58:10,157 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:58:10,158 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:10,158 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:58:10,162 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:58:10,163 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc16611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10, skipping insertion in model container [2019-11-07 03:58:10,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,174 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:58:10,205 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:58:10,390 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:10,398 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:58:10,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:10,493 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:58:10,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10 WrapperNode [2019-11-07 03:58:10,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:10,494 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:58:10,495 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:58:10,496 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:58:10,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,580 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,589 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,598 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,600 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... [2019-11-07 03:58:10,602 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:58:10,603 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:58:10,603 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:58:10,603 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:58:10,604 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:58:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:58:10,657 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:58:10,657 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:58:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:58:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:58:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:58:10,658 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:58:11,251 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:58:11,251 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 03:58:11,257 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:11 BoogieIcfgContainer [2019-11-07 03:58:11,257 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:58:11,259 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:58:11,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:58:11,263 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:58:11,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:10" (1/3) ... [2019-11-07 03:58:11,265 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbdb168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:11, skipping insertion in model container [2019-11-07 03:58:11,265 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:10" (2/3) ... [2019-11-07 03:58:11,266 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bbdb168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:11, skipping insertion in model container [2019-11-07 03:58:11,267 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:11" (3/3) ... [2019-11-07 03:58:11,279 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-11-07 03:58:11,301 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:58:11,309 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:58:11,320 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:58:11,344 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:58:11,345 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:58:11,345 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:58:11,345 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:58:11,345 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:58:11,346 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:58:11,346 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:58:11,346 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:58:11,366 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-07 03:58:11,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 03:58:11,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:11,373 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:11,375 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash 563061398, now seen corresponding path program 1 times [2019-11-07 03:58:11,389 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:11,389 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240054131] [2019-11-07 03:58:11,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:11,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:11,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:11,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240054131] [2019-11-07 03:58:11,591 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:11,592 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:11,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317137208] [2019-11-07 03:58:11,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:11,600 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:11,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:11,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:11,618 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-07 03:58:11,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:11,691 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2019-11-07 03:58:11,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:11,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 03:58:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:11,713 INFO L225 Difference]: With dead ends: 70 [2019-11-07 03:58:11,713 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 03:58:11,719 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:11,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 03:58:11,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-11-07 03:58:11,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:11,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-11-07 03:58:11,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10 [2019-11-07 03:58:11,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:11,763 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-11-07 03:58:11,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:11,764 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-11-07 03:58:11,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 03:58:11,764 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:11,764 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:11,765 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:11,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:11,765 INFO L82 PathProgramCache]: Analyzing trace with hash 275247210, now seen corresponding path program 1 times [2019-11-07 03:58:11,766 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:11,766 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370346774] [2019-11-07 03:58:11,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:11,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:11,855 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370346774] [2019-11-07 03:58:11,856 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:11,856 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:11,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966552405] [2019-11-07 03:58:11,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:11,860 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:11,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:11,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:11,860 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-11-07 03:58:11,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:11,889 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2019-11-07 03:58:11,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:11,890 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 03:58:11,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:11,892 INFO L225 Difference]: With dead ends: 55 [2019-11-07 03:58:11,892 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 03:58:11,893 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:11,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 03:58:11,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-11-07 03:58:11,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:11,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2019-11-07 03:58:11,900 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11 [2019-11-07 03:58:11,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:11,900 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2019-11-07 03:58:11,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:11,900 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2019-11-07 03:58:11,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 03:58:11,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:11,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:11,902 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:11,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:11,902 INFO L82 PathProgramCache]: Analyzing trace with hash -57057685, now seen corresponding path program 1 times [2019-11-07 03:58:11,903 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:11,903 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873980396] [2019-11-07 03:58:11,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:11,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-11-07 03:58:11,963 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873980396] [2019-11-07 03:58:11,964 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:11,965 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:11,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518072739] [2019-11-07 03:58:11,965 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:11,966 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:11,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:11,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:11,967 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 4 states. [2019-11-07 03:58:12,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,008 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2019-11-07 03:58:12,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 03:58:12,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,011 INFO L225 Difference]: With dead ends: 53 [2019-11-07 03:58:12,011 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 03:58:12,012 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 03:58:12,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-11-07 03:58:12,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2019-11-07 03:58:12,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12 [2019-11-07 03:58:12,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,028 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2019-11-07 03:58:12,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,028 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2019-11-07 03:58:12,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 03:58:12,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1768574497, now seen corresponding path program 1 times [2019-11-07 03:58:12,036 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,037 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557976853] [2019-11-07 03:58:12,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,118 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557976853] [2019-11-07 03:58:12,119 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,119 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749859123] [2019-11-07 03:58:12,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,120 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,121 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states. [2019-11-07 03:58:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,158 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2019-11-07 03:58:12,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-07 03:58:12,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,161 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:58:12,161 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 03:58:12,161 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 03:58:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2019-11-07 03:58:12,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2019-11-07 03:58:12,177 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2019-11-07 03:58:12,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,177 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2019-11-07 03:58:12,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,178 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2019-11-07 03:58:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 03:58:12,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,179 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,179 INFO L82 PathProgramCache]: Analyzing trace with hash 1008979520, now seen corresponding path program 1 times [2019-11-07 03:58:12,180 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,180 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256771098] [2019-11-07 03:58:12,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,246 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256771098] [2019-11-07 03:58:12,246 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,246 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252114020] [2019-11-07 03:58:12,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,247 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,248 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. [2019-11-07 03:58:12,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,272 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2019-11-07 03:58:12,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 03:58:12,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,274 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:58:12,274 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 03:58:12,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 03:58:12,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-11-07 03:58:12,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2019-11-07 03:58:12,280 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2019-11-07 03:58:12,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,280 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2019-11-07 03:58:12,280 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,281 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2019-11-07 03:58:12,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 03:58:12,281 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,282 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,282 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,282 INFO L82 PathProgramCache]: Analyzing trace with hash 1213808468, now seen corresponding path program 1 times [2019-11-07 03:58:12,282 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,283 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901828384] [2019-11-07 03:58:12,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,320 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901828384] [2019-11-07 03:58:12,320 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,320 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291135812] [2019-11-07 03:58:12,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,321 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,322 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 4 states. [2019-11-07 03:58:12,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,345 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2019-11-07 03:58:12,346 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,346 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 03:58:12,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,347 INFO L225 Difference]: With dead ends: 47 [2019-11-07 03:58:12,347 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:58:12,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:58:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-11-07 03:58:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-11-07 03:58:12,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15 [2019-11-07 03:58:12,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,353 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-11-07 03:58:12,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-11-07 03:58:12,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 03:58:12,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,355 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1026428395, now seen corresponding path program 1 times [2019-11-07 03:58:12,356 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,356 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729319247] [2019-11-07 03:58:12,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,393 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729319247] [2019-11-07 03:58:12,393 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,393 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700897511] [2019-11-07 03:58:12,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,394 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,395 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 4 states. [2019-11-07 03:58:12,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,425 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-11-07 03:58:12,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 03:58:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,428 INFO L225 Difference]: With dead ends: 45 [2019-11-07 03:58:12,429 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 03:58:12,429 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 03:58:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-11-07 03:58:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-11-07 03:58:12,434 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-11-07 03:58:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,434 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-11-07 03:58:12,434 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-11-07 03:58:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 03:58:12,435 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,435 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,436 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1754294071, now seen corresponding path program 1 times [2019-11-07 03:58:12,436 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,437 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433482903] [2019-11-07 03:58:12,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,475 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433482903] [2019-11-07 03:58:12,475 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,475 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118877153] [2019-11-07 03:58:12,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,476 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,477 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 4 states. [2019-11-07 03:58:12,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,497 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-11-07 03:58:12,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-07 03:58:12,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,499 INFO L225 Difference]: With dead ends: 43 [2019-11-07 03:58:12,499 INFO L226 Difference]: Without dead ends: 41 [2019-11-07 03:58:12,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-07 03:58:12,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-11-07 03:58:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-07 03:58:12,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2019-11-07 03:58:12,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,504 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-07 03:58:12,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,504 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2019-11-07 03:58:12,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 03:58:12,505 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,505 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,521 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,522 INFO L82 PathProgramCache]: Analyzing trace with hash 1451674090, now seen corresponding path program 1 times [2019-11-07 03:58:12,522 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,522 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500189712] [2019-11-07 03:58:12,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,589 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500189712] [2019-11-07 03:58:12,590 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,590 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707894636] [2019-11-07 03:58:12,590 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,592 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,593 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 4 states. [2019-11-07 03:58:12,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,622 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-11-07 03:58:12,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,622 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-07 03:58:12,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,623 INFO L225 Difference]: With dead ends: 41 [2019-11-07 03:58:12,623 INFO L226 Difference]: Without dead ends: 39 [2019-11-07 03:58:12,624 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-07 03:58:12,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-11-07 03:58:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-11-07 03:58:12,630 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 18 [2019-11-07 03:58:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,630 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-11-07 03:58:12,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,630 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2019-11-07 03:58:12,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 03:58:12,634 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,635 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,635 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,635 INFO L82 PathProgramCache]: Analyzing trace with hash 2052439614, now seen corresponding path program 1 times [2019-11-07 03:58:12,636 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,636 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546451474] [2019-11-07 03:58:12,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,692 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546451474] [2019-11-07 03:58:12,693 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,693 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,693 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666011646] [2019-11-07 03:58:12,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,694 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,694 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 4 states. [2019-11-07 03:58:12,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,711 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-11-07 03:58:12,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,712 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-07 03:58:12,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,712 INFO L225 Difference]: With dead ends: 39 [2019-11-07 03:58:12,713 INFO L226 Difference]: Without dead ends: 37 [2019-11-07 03:58:12,713 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-11-07 03:58:12,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-11-07 03:58:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-07 03:58:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-07 03:58:12,716 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2019-11-07 03:58:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,717 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-07 03:58:12,717 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,717 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-07 03:58:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 03:58:12,718 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:12,718 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:12,718 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:12,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:12,719 INFO L82 PathProgramCache]: Analyzing trace with hash -798665281, now seen corresponding path program 1 times [2019-11-07 03:58:12,719 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:12,719 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381611578] [2019-11-07 03:58:12,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:12,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:12,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:12,765 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381611578] [2019-11-07 03:58:12,765 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:12,765 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:12,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654443726] [2019-11-07 03:58:12,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:12,766 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:12,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:12,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,767 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-07 03:58:12,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:12,784 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-11-07 03:58:12,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:12,784 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 03:58:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:12,785 INFO L225 Difference]: With dead ends: 33 [2019-11-07 03:58:12,785 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 03:58:12,785 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:12,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 03:58:12,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 03:58:12,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 03:58:12,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 03:58:12,786 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-11-07 03:58:12,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:12,787 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 03:58:12,787 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:12,787 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 03:58:12,787 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 03:58:12,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 03:58:12,825 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 03:58:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:12,826 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 03:58:12,826 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 03:58:12,826 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 03:58:12,826 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-11-07 03:58:12,826 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-11-07 03:58:12,827 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-11-07 03:58:12,827 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-07 03:58:12,827 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-11-07 03:58:12,827 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-11-07 03:58:12,827 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,828 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-11-07 03:58:12,829 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,830 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,831 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-11-07 03:58:12,832 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-11-07 03:58:12,849 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:58:12 BoogieIcfgContainer [2019-11-07 03:58:12,849 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 03:58:12,860 INFO L168 Benchmark]: Toolchain (without parser) took 2696.27 ms. Allocated memory was 138.4 MB in the beginning and 253.8 MB in the end (delta: 115.3 MB). Free memory was 103.3 MB in the beginning and 199.8 MB in the end (delta: -96.5 MB). Peak memory consumption was 18.9 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:12,870 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 03:58:12,877 INFO L168 Benchmark]: CACSL2BoogieTranslator took 335.96 ms. Allocated memory was 138.4 MB in the beginning and 167.8 MB in the end (delta: 29.4 MB). Free memory was 103.1 MB in the beginning and 145.3 MB in the end (delta: -42.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:12,885 INFO L168 Benchmark]: Boogie Preprocessor took 108.19 ms. Allocated memory was 167.8 MB in the beginning and 221.8 MB in the end (delta: 54.0 MB). Free memory was 145.3 MB in the beginning and 206.8 MB in the end (delta: -61.5 MB). Peak memory consumption was 733.3 kB. Max. memory is 7.1 GB. [2019-11-07 03:58:12,886 INFO L168 Benchmark]: RCFGBuilder took 654.34 ms. Allocated memory is still 221.8 MB. Free memory was 206.8 MB in the beginning and 167.0 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:12,888 INFO L168 Benchmark]: TraceAbstraction took 1590.06 ms. Allocated memory was 221.8 MB in the beginning and 253.8 MB in the end (delta: 32.0 MB). Free memory was 167.0 MB in the beginning and 199.8 MB in the end (delta: -32.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-11-07 03:58:12,895 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 335.96 ms. Allocated memory was 138.4 MB in the beginning and 167.8 MB in the end (delta: 29.4 MB). Free memory was 103.1 MB in the beginning and 145.3 MB in the end (delta: -42.2 MB). Peak memory consumption was 20.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 108.19 ms. Allocated memory was 167.8 MB in the beginning and 221.8 MB in the end (delta: 54.0 MB). Free memory was 145.3 MB in the beginning and 206.8 MB in the end (delta: -61.5 MB). Peak memory consumption was 733.3 kB. Max. memory is 7.1 GB. * RCFGBuilder took 654.34 ms. Allocated memory is still 221.8 MB. Free memory was 206.8 MB in the beginning and 167.0 MB in the end (delta: 39.7 MB). Peak memory consumption was 39.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1590.06 ms. Allocated memory was 221.8 MB in the beginning and 253.8 MB in the end (delta: 32.0 MB). Free memory was 167.0 MB in the beginning and 199.8 MB in the end (delta: -32.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 1.4s, OverallIterations: 11, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 492 SDtfs, 376 SDslu, 700 SDs, 0 SdLazy, 99 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 44 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 150 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 165 NumberOfCodeBlocks, 165 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 154 ConstructedInterpolants, 0 QuantifiedInterpolants, 8778 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...