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-13a467a-m [2019-10-15 03:00:38,137 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:38,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:38,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:38,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:38,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:38,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:38,172 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:38,177 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:38,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:38,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:38,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:38,183 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:38,184 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:38,187 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:38,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:38,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:38,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:38,192 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:38,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:38,201 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:38,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:38,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:38,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:38,209 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:38,209 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:38,209 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:38,211 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:38,212 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:38,213 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:38,213 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:38,215 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:38,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:38,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:38,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:38,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:38,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:38,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:38,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:38,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:38,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:38,223 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 03:00:38,254 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:38,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:38,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:38,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:38,262 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:38,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:38,263 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:38,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:38,263 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:38,263 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:38,263 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:38,264 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:38,265 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:38,265 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:38,265 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:38,265 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:38,265 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:38,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:38,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:38,266 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:38,266 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:38,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:38,267 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:38,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-15 03:00:38,523 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:38,541 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:38,546 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:38,547 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:38,548 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:38,548 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_11.c [2019-10-15 03:00:38,634 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72872ad84/69b92838ed3343ec8914a98d3d507adf/FLAGb9f36ef47 [2019-10-15 03:00:39,143 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:39,144 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_11.c [2019-10-15 03:00:39,152 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72872ad84/69b92838ed3343ec8914a98d3d507adf/FLAGb9f36ef47 [2019-10-15 03:00:39,458 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/72872ad84/69b92838ed3343ec8914a98d3d507adf [2019-10-15 03:00:39,466 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:39,467 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:39,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:39,469 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:39,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:39,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c679016 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39, skipping insertion in model container [2019-10-15 03:00:39,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,485 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:39,509 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:39,703 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:39,708 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:39,735 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:39,749 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:39,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39 WrapperNode [2019-10-15 03:00:39,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:39,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:39,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:39,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:39,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,855 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,855 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,861 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... [2019-10-15 03:00:39,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:39,878 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:39,878 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:39,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:39,879 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:39,929 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:39,929 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:39,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:40,548 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:40,549 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:40,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:40 BoogieIcfgContainer [2019-10-15 03:00:40,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:40,555 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:40,555 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:40,558 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:40,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:39" (1/3) ... [2019-10-15 03:00:40,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe29b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:40, skipping insertion in model container [2019-10-15 03:00:40,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:39" (2/3) ... [2019-10-15 03:00:40,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fe29b1a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:40, skipping insertion in model container [2019-10-15 03:00:40,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:40" (3/3) ... [2019-10-15 03:00:40,564 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2019-10-15 03:00:40,572 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:40,579 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:40,588 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:40,614 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:40,614 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:40,614 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:40,614 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:40,615 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:40,615 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:40,615 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:40,615 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:40,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-10-15 03:00:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:40,639 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:40,640 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:40,642 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:40,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:40,647 INFO L82 PathProgramCache]: Analyzing trace with hash 563061398, now seen corresponding path program 1 times [2019-10-15 03:00:40,654 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:40,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841722695] [2019-10-15 03:00:40,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:40,655 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:40,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:40,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:40,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:40,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841722695] [2019-10-15 03:00:40,865 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:40,866 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:40,866 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110809733] [2019-10-15 03:00:40,871 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:40,871 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:40,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:40,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:40,890 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-10-15 03:00:40,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:40,952 INFO L93 Difference]: Finished difference Result 70 states and 114 transitions. [2019-10-15 03:00:40,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:40,955 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:40,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:40,968 INFO L225 Difference]: With dead ends: 70 [2019-10-15 03:00:40,968 INFO L226 Difference]: Without dead ends: 55 [2019-10-15 03:00:40,972 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:40,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-15 03:00:41,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 31. [2019-10-15 03:00:41,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 51 transitions. [2019-10-15 03:00:41,015 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 51 transitions. Word has length 10 [2019-10-15 03:00:41,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,016 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 51 transitions. [2019-10-15 03:00:41,016 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 51 transitions. [2019-10-15 03:00:41,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:41,017 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,017 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,018 INFO L82 PathProgramCache]: Analyzing trace with hash 275247210, now seen corresponding path program 1 times [2019-10-15 03:00:41,018 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316295820] [2019-10-15 03:00:41,018 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,019 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,079 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316295820] [2019-10-15 03:00:41,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,080 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427431471] [2019-10-15 03:00:41,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,081 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,082 INFO L87 Difference]: Start difference. First operand 31 states and 51 transitions. Second operand 4 states. [2019-10-15 03:00:41,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,109 INFO L93 Difference]: Finished difference Result 55 states and 91 transitions. [2019-10-15 03:00:41,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,110 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:41,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,111 INFO L225 Difference]: With dead ends: 55 [2019-10-15 03:00:41,112 INFO L226 Difference]: Without dead ends: 53 [2019-10-15 03:00:41,112 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-15 03:00:41,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 31. [2019-10-15 03:00:41,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 50 transitions. [2019-10-15 03:00:41,120 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 50 transitions. Word has length 11 [2019-10-15 03:00:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,120 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 50 transitions. [2019-10-15 03:00:41,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 50 transitions. [2019-10-15 03:00:41,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:41,121 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,122 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,123 INFO L82 PathProgramCache]: Analyzing trace with hash -57057685, now seen corresponding path program 1 times [2019-10-15 03:00:41,123 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541411209] [2019-10-15 03:00:41,123 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,181 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541411209] [2019-10-15 03:00:41,181 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,181 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,182 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542822046] [2019-10-15 03:00:41,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,182 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,183 INFO L87 Difference]: Start difference. First operand 31 states and 50 transitions. Second operand 4 states. [2019-10-15 03:00:41,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,209 INFO L93 Difference]: Finished difference Result 53 states and 86 transitions. [2019-10-15 03:00:41,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,211 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:41,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,212 INFO L225 Difference]: With dead ends: 53 [2019-10-15 03:00:41,212 INFO L226 Difference]: Without dead ends: 51 [2019-10-15 03:00:41,213 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-10-15 03:00:41,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 31. [2019-10-15 03:00:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 49 transitions. [2019-10-15 03:00:41,220 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 49 transitions. Word has length 12 [2019-10-15 03:00:41,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,220 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 49 transitions. [2019-10-15 03:00:41,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,221 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 49 transitions. [2019-10-15 03:00:41,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:41,221 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,222 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,222 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,222 INFO L82 PathProgramCache]: Analyzing trace with hash -1768574497, now seen corresponding path program 1 times [2019-10-15 03:00:41,223 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,223 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736272944] [2019-10-15 03:00:41,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,223 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736272944] [2019-10-15 03:00:41,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,280 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,280 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602525154] [2019-10-15 03:00:41,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,281 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,282 INFO L87 Difference]: Start difference. First operand 31 states and 49 transitions. Second operand 4 states. [2019-10-15 03:00:41,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,336 INFO L93 Difference]: Finished difference Result 51 states and 81 transitions. [2019-10-15 03:00:41,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,337 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:41,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,338 INFO L225 Difference]: With dead ends: 51 [2019-10-15 03:00:41,338 INFO L226 Difference]: Without dead ends: 49 [2019-10-15 03:00:41,338 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-10-15 03:00:41,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2019-10-15 03:00:41,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 48 transitions. [2019-10-15 03:00:41,344 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 48 transitions. Word has length 13 [2019-10-15 03:00:41,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,344 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 48 transitions. [2019-10-15 03:00:41,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 48 transitions. [2019-10-15 03:00:41,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:41,345 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,345 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,345 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,346 INFO L82 PathProgramCache]: Analyzing trace with hash 1008979520, now seen corresponding path program 1 times [2019-10-15 03:00:41,346 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878767089] [2019-10-15 03:00:41,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,347 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,419 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878767089] [2019-10-15 03:00:41,419 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,420 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,420 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913787048] [2019-10-15 03:00:41,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,421 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,422 INFO L87 Difference]: Start difference. First operand 31 states and 48 transitions. Second operand 4 states. [2019-10-15 03:00:41,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,447 INFO L93 Difference]: Finished difference Result 49 states and 76 transitions. [2019-10-15 03:00:41,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:41,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,449 INFO L225 Difference]: With dead ends: 49 [2019-10-15 03:00:41,449 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:41,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:41,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 31. [2019-10-15 03:00:41,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 47 transitions. [2019-10-15 03:00:41,454 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 47 transitions. Word has length 14 [2019-10-15 03:00:41,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,455 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 47 transitions. [2019-10-15 03:00:41,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 47 transitions. [2019-10-15 03:00:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:41,456 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,456 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1213808468, now seen corresponding path program 1 times [2019-10-15 03:00:41,457 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389425551] [2019-10-15 03:00:41,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,517 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389425551] [2019-10-15 03:00:41,517 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,518 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,518 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944386362] [2019-10-15 03:00:41,518 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,518 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,521 INFO L87 Difference]: Start difference. First operand 31 states and 47 transitions. Second operand 4 states. [2019-10-15 03:00:41,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,546 INFO L93 Difference]: Finished difference Result 47 states and 71 transitions. [2019-10-15 03:00:41,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,547 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:41,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,548 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:41,548 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:41,549 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2019-10-15 03:00:41,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 46 transitions. [2019-10-15 03:00:41,556 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 46 transitions. Word has length 15 [2019-10-15 03:00:41,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,557 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 46 transitions. [2019-10-15 03:00:41,557 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,557 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 46 transitions. [2019-10-15 03:00:41,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:41,558 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,558 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,558 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,564 INFO L82 PathProgramCache]: Analyzing trace with hash -1026428395, now seen corresponding path program 1 times [2019-10-15 03:00:41,565 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,565 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256877328] [2019-10-15 03:00:41,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,565 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256877328] [2019-10-15 03:00:41,629 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,629 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,629 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083142890] [2019-10-15 03:00:41,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,629 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,630 INFO L87 Difference]: Start difference. First operand 31 states and 46 transitions. Second operand 4 states. [2019-10-15 03:00:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,648 INFO L93 Difference]: Finished difference Result 45 states and 66 transitions. [2019-10-15 03:00:41,649 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,649 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,650 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:41,650 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:41,650 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:41,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 31. [2019-10-15 03:00:41,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2019-10-15 03:00:41,655 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 16 [2019-10-15 03:00:41,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,655 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2019-10-15 03:00:41,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,655 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2019-10-15 03:00:41,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:41,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,656 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1754294071, now seen corresponding path program 1 times [2019-10-15 03:00:41,657 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,657 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794674725] [2019-10-15 03:00:41,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,657 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,691 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794674725] [2019-10-15 03:00:41,692 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,692 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,692 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331055713] [2019-10-15 03:00:41,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,693 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,693 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 4 states. [2019-10-15 03:00:41,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,717 INFO L93 Difference]: Finished difference Result 43 states and 61 transitions. [2019-10-15 03:00:41,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:41,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,718 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:41,718 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:41,719 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:41,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2019-10-15 03:00:41,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-10-15 03:00:41,722 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 44 transitions. Word has length 17 [2019-10-15 03:00:41,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,723 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-10-15 03:00:41,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,723 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 44 transitions. [2019-10-15 03:00:41,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:41,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,725 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1451674090, now seen corresponding path program 1 times [2019-10-15 03:00:41,725 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138667979] [2019-10-15 03:00:41,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,726 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,773 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,774 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138667979] [2019-10-15 03:00:41,775 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,775 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,775 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25633703] [2019-10-15 03:00:41,776 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,779 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. Second operand 4 states. [2019-10-15 03:00:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,811 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2019-10-15 03:00:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:41,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,812 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:41,813 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:00:41,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:00:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 31. [2019-10-15 03:00:41,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 43 transitions. [2019-10-15 03:00:41,820 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 43 transitions. Word has length 18 [2019-10-15 03:00:41,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,820 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 43 transitions. [2019-10-15 03:00:41,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,820 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 43 transitions. [2019-10-15 03:00:41,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-15 03:00:41,821 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,821 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,822 INFO L82 PathProgramCache]: Analyzing trace with hash 2052439614, now seen corresponding path program 1 times [2019-10-15 03:00:41,827 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930431498] [2019-10-15 03:00:41,828 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,829 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,887 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930431498] [2019-10-15 03:00:41,887 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,888 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638467015] [2019-10-15 03:00:41,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,890 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,891 INFO L87 Difference]: Start difference. First operand 31 states and 43 transitions. Second operand 4 states. [2019-10-15 03:00:41,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,908 INFO L93 Difference]: Finished difference Result 39 states and 51 transitions. [2019-10-15 03:00:41,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-10-15 03:00:41,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,909 INFO L225 Difference]: With dead ends: 39 [2019-10-15 03:00:41,909 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 03:00:41,910 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 03:00:41,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2019-10-15 03:00:41,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-15 03:00:41,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-15 03:00:41,913 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 19 [2019-10-15 03:00:41,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,914 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-15 03:00:41,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-15 03:00:41,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-15 03:00:41,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:41,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:41,915 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:41,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:41,916 INFO L82 PathProgramCache]: Analyzing trace with hash -798665281, now seen corresponding path program 1 times [2019-10-15 03:00:41,916 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:41,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999006291] [2019-10-15 03:00:41,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:41,916 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:41,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:41,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:41,961 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999006291] [2019-10-15 03:00:41,962 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:41,962 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:41,962 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122692514] [2019-10-15 03:00:41,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:41,963 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:41,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:41,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,964 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-10-15 03:00:41,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:41,984 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2019-10-15 03:00:41,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:41,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-10-15 03:00:41,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:41,986 INFO L225 Difference]: With dead ends: 33 [2019-10-15 03:00:41,986 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:41,987 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:41,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:41,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:41,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:41,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:41,987 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 20 [2019-10-15 03:00:41,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:41,988 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:41,988 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:41,988 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:41,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:41,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:42,012 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:42,012 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:42,012 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:42,012 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:42,012 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:42,012 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 177) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L443 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L443 ceAbstractionStarter]: For program point L143(line 143) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L443 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2019-10-15 03:00:42,013 INFO L439 ceAbstractionStarter]: At program point L168-1(lines 5 177) the Hoare annotation is: false [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L127-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L152-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L111-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L128(line 128) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 177) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L137-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,014 INFO L443 ceAbstractionStarter]: For program point L162-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 177) the Hoare annotation is: true [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L122-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L147-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L443 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-10-15 03:00:42,015 INFO L446 ceAbstractionStarter]: At program point L173(lines 5 177) the Hoare annotation is: true [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L132-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L157-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 175) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L158(line 158) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L117-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L443 ceAbstractionStarter]: For program point L142-1(lines 42 172) no Hoare annotation was computed. [2019-10-15 03:00:42,016 INFO L446 ceAbstractionStarter]: At program point L167-1(lines 42 172) the Hoare annotation is: true [2019-10-15 03:00:42,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:42 BoogieIcfgContainer [2019-10-15 03:00:42,026 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:42,029 INFO L168 Benchmark]: Toolchain (without parser) took 2560.17 ms. Allocated memory was 140.0 MB in the beginning and 232.3 MB in the end (delta: 92.3 MB). Free memory was 104.8 MB in the beginning and 135.0 MB in the end (delta: -30.1 MB). Peak memory consumption was 62.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,030 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.93 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 93.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,038 INFO L168 Benchmark]: Boogie Preprocessor took 127.02 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.8 MB in the beginning and 182.3 MB in the end (delta: -88.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,038 INFO L168 Benchmark]: RCFGBuilder took 675.03 ms. Allocated memory is still 204.5 MB. Free memory was 182.3 MB in the beginning and 143.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,040 INFO L168 Benchmark]: TraceAbstraction took 1470.97 ms. Allocated memory was 204.5 MB in the beginning and 232.3 MB in the end (delta: 27.8 MB). Free memory was 143.3 MB in the beginning and 135.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:42,050 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.19 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.93 ms. Allocated memory is still 140.0 MB. Free memory was 104.6 MB in the beginning and 93.8 MB in the end (delta: 10.8 MB). Peak memory consumption was 10.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 127.02 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 93.8 MB in the beginning and 182.3 MB in the end (delta: -88.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 675.03 ms. Allocated memory is still 204.5 MB. Free memory was 182.3 MB in the beginning and 143.3 MB in the end (delta: 39.0 MB). Peak memory consumption was 39.0 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1470.97 ms. Allocated memory was 204.5 MB in the beginning and 232.3 MB in the end (delta: 27.8 MB). Free memory was 143.3 MB in the beginning and 135.0 MB in the end (delta: 8.3 MB). Peak memory consumption was 36.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 175]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 1 error locations. Result: SAFE, OverallTime: 1.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.1s 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...