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_9.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 03:00:55,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 03:00:55,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 03:00:55,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 03:00:55,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 03:00:55,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 03:00:55,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 03:00:55,713 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 03:00:55,719 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 03:00:55,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 03:00:55,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 03:00:55,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 03:00:55,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 03:00:55,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 03:00:55,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 03:00:55,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 03:00:55,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 03:00:55,732 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 03:00:55,733 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 03:00:55,737 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 03:00:55,742 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 03:00:55,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 03:00:55,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 03:00:55,749 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 03:00:55,751 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 03:00:55,751 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 03:00:55,751 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 03:00:55,753 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 03:00:55,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 03:00:55,756 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 03:00:55,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 03:00:55,757 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 03:00:55,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 03:00:55,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 03:00:55,760 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 03:00:55,760 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 03:00:55,760 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 03:00:55,761 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 03:00:55,761 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 03:00:55,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 03:00:55,763 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 03:00:55,763 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:55,783 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 03:00:55,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 03:00:55,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 03:00:55,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 03:00:55,785 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 03:00:55,790 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 03:00:55,790 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 03:00:55,790 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 03:00:55,790 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 03:00:55,790 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 03:00:55,790 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 03:00:55,791 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 03:00:55,791 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 03:00:55,791 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 03:00:55,791 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 03:00:55,791 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 03:00:55,792 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 03:00:55,792 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 03:00:55,792 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 03:00:55,792 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 03:00:55,792 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 03:00:55,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 03:00:55,793 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 03:00:55,793 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 03:00:55,793 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 03:00:55,794 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 03:00:55,794 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 03:00:55,794 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 03:00:55,794 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:56,074 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 03:00:56,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 03:00:56,097 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 03:00:56,098 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 03:00:56,099 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 03:00:56,099 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_9.c [2019-10-15 03:00:56,176 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e85fc3/a3a2ad53771c43fea3967ecfa71138a9/FLAG8f3c50748 [2019-10-15 03:00:56,650 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 03:00:56,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_9.c [2019-10-15 03:00:56,659 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e85fc3/a3a2ad53771c43fea3967ecfa71138a9/FLAG8f3c50748 [2019-10-15 03:00:57,024 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f77e85fc3/a3a2ad53771c43fea3967ecfa71138a9 [2019-10-15 03:00:57,036 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 03:00:57,038 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 03:00:57,039 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:57,039 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 03:00:57,043 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 03:00:57,044 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:57" (1/1) ... [2019-10-15 03:00:57,047 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67e4cadf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:57, skipping insertion in model container [2019-10-15 03:00:57,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 03:00:57" (1/1) ... [2019-10-15 03:00:57,056 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 03:00:57,078 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 03:00:57,287 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:57,292 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 03:00:57,318 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 03:00:57,417 INFO L192 MainTranslator]: Completed translation [2019-10-15 03:00:57,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:57 WrapperNode [2019-10-15 03:00:57,417 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 03:00:57,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 03:00:57,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 03:00:57,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 03:00:57,430 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:57" (1/1) ... [2019-10-15 03:00:57,430 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:57" (1/1) ... [2019-10-15 03:00:57,436 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:57" (1/1) ... [2019-10-15 03:00:57,436 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:57" (1/1) ... [2019-10-15 03:00:57,446 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:57" (1/1) ... [2019-10-15 03:00:57,454 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:57" (1/1) ... [2019-10-15 03:00:57,456 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:57" (1/1) ... [2019-10-15 03:00:57,458 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 03:00:57,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 03:00:57,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 03:00:57,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 03:00:57,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:57" (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:57,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 03:00:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 03:00:57,521 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 03:00:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 03:00:57,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 03:00:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 03:00:57,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 03:00:57,525 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 03:00:58,038 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 03:00:58,039 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-10-15 03:00:58,040 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:58 BoogieIcfgContainer [2019-10-15 03:00:58,040 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 03:00:58,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 03:00:58,042 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 03:00:58,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 03:00:58,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 03:00:57" (1/3) ... [2019-10-15 03:00:58,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b583d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:58, skipping insertion in model container [2019-10-15 03:00:58,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 03:00:57" (2/3) ... [2019-10-15 03:00:58,047 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53b583d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:00:58, skipping insertion in model container [2019-10-15 03:00:58,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:00:58" (3/3) ... [2019-10-15 03:00:58,049 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2019-10-15 03:00:58,059 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 03:00:58,066 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 03:00:58,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 03:00:58,104 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 03:00:58,104 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 03:00:58,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 03:00:58,105 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 03:00:58,105 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 03:00:58,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 03:00:58,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 03:00:58,106 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 03:00:58,125 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-15 03:00:58,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-15 03:00:58,130 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:58,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:58,132 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash -582921348, now seen corresponding path program 1 times [2019-10-15 03:00:58,145 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:58,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666287017] [2019-10-15 03:00:58,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,146 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:58,335 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:58,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666287017] [2019-10-15 03:00:58,337 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:58,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:58,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534494007] [2019-10-15 03:00:58,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:58,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:58,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:58,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:58,363 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 4 states. [2019-10-15 03:00:58,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:58,425 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-15 03:00:58,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:58,429 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-10-15 03:00:58,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:58,446 INFO L225 Difference]: With dead ends: 62 [2019-10-15 03:00:58,446 INFO L226 Difference]: Without dead ends: 47 [2019-10-15 03:00:58,451 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:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-10-15 03:00:58,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 27. [2019-10-15 03:00:58,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 43 transitions. [2019-10-15 03:00:58,511 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 43 transitions. Word has length 10 [2019-10-15 03:00:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:58,512 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 43 transitions. [2019-10-15 03:00:58,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:58,512 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 43 transitions. [2019-10-15 03:00:58,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-15 03:00:58,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:58,514 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:58,515 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash -890478900, now seen corresponding path program 1 times [2019-10-15 03:00:58,516 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:58,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895558489] [2019-10-15 03:00:58,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,517 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:58,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:58,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 03:00:58,627 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895558489] [2019-10-15 03:00:58,628 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:58,628 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:58,628 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670360238] [2019-10-15 03:00:58,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:58,632 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:58,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:58,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:58,633 INFO L87 Difference]: Start difference. First operand 27 states and 43 transitions. Second operand 4 states. [2019-10-15 03:00:58,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:58,670 INFO L93 Difference]: Finished difference Result 47 states and 75 transitions. [2019-10-15 03:00:58,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:58,670 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-15 03:00:58,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:58,672 INFO L225 Difference]: With dead ends: 47 [2019-10-15 03:00:58,672 INFO L226 Difference]: Without dead ends: 45 [2019-10-15 03:00:58,673 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:58,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-10-15 03:00:58,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 27. [2019-10-15 03:00:58,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:58,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 42 transitions. [2019-10-15 03:00:58,684 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 42 transitions. Word has length 11 [2019-10-15 03:00:58,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:58,684 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 42 transitions. [2019-10-15 03:00:58,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:58,685 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 42 transitions. [2019-10-15 03:00:58,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-15 03:00:58,686 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:58,686 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:58,686 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:58,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:58,687 INFO L82 PathProgramCache]: Analyzing trace with hash -1834828079, now seen corresponding path program 1 times [2019-10-15 03:00:58,687 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:58,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637100432] [2019-10-15 03:00:58,688 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,689 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:58,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:58,749 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:58,750 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637100432] [2019-10-15 03:00:58,750 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:58,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:58,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213802005] [2019-10-15 03:00:58,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:58,751 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:58,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:58,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:58,752 INFO L87 Difference]: Start difference. First operand 27 states and 42 transitions. Second operand 4 states. [2019-10-15 03:00:58,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:58,785 INFO L93 Difference]: Finished difference Result 45 states and 70 transitions. [2019-10-15 03:00:58,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:58,786 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-15 03:00:58,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:58,788 INFO L225 Difference]: With dead ends: 45 [2019-10-15 03:00:58,788 INFO L226 Difference]: Without dead ends: 43 [2019-10-15 03:00:58,788 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:58,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-15 03:00:58,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2019-10-15 03:00:58,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:58,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 41 transitions. [2019-10-15 03:00:58,797 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 41 transitions. Word has length 12 [2019-10-15 03:00:58,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:58,797 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 41 transitions. [2019-10-15 03:00:58,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:58,798 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 41 transitions. [2019-10-15 03:00:58,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-15 03:00:58,800 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:58,800 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:58,800 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:58,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:58,801 INFO L82 PathProgramCache]: Analyzing trace with hash -1044881215, now seen corresponding path program 1 times [2019-10-15 03:00:58,801 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:58,801 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750331227] [2019-10-15 03:00:58,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,802 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:58,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:58,882 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:58,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750331227] [2019-10-15 03:00:58,882 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:58,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:58,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377492802] [2019-10-15 03:00:58,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:58,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:58,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:58,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:58,885 INFO L87 Difference]: Start difference. First operand 27 states and 41 transitions. Second operand 4 states. [2019-10-15 03:00:58,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:58,910 INFO L93 Difference]: Finished difference Result 43 states and 65 transitions. [2019-10-15 03:00:58,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:58,911 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-15 03:00:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:58,912 INFO L225 Difference]: With dead ends: 43 [2019-10-15 03:00:58,912 INFO L226 Difference]: Without dead ends: 41 [2019-10-15 03:00:58,913 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:58,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-15 03:00:58,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-15 03:00:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 40 transitions. [2019-10-15 03:00:58,918 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 40 transitions. Word has length 13 [2019-10-15 03:00:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:58,919 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 40 transitions. [2019-10-15 03:00:58,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:58,919 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 40 transitions. [2019-10-15 03:00:58,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-15 03:00:58,920 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:58,920 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 03:00:58,921 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:58,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:58,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1968635430, now seen corresponding path program 1 times [2019-10-15 03:00:58,921 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:58,922 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280654056] [2019-10-15 03:00:58,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,922 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:58,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:58,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:58,971 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:58,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280654056] [2019-10-15 03:00:58,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:58,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:58,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017354873] [2019-10-15 03:00:58,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:58,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:58,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:58,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:58,974 INFO L87 Difference]: Start difference. First operand 27 states and 40 transitions. Second operand 4 states. [2019-10-15 03:00:59,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:59,001 INFO L93 Difference]: Finished difference Result 41 states and 60 transitions. [2019-10-15 03:00:59,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:59,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-15 03:00:59,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:59,003 INFO L225 Difference]: With dead ends: 41 [2019-10-15 03:00:59,003 INFO L226 Difference]: Without dead ends: 39 [2019-10-15 03:00:59,003 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:59,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-15 03:00:59,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 27. [2019-10-15 03:00:59,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:59,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2019-10-15 03:00:59,008 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 14 [2019-10-15 03:00:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:59,009 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2019-10-15 03:00:59,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2019-10-15 03:00:59,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-15 03:00:59,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:59,010 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:59,011 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:59,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:59,011 INFO L82 PathProgramCache]: Analyzing trace with hash 898371254, now seen corresponding path program 1 times [2019-10-15 03:00:59,011 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:59,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702513261] [2019-10-15 03:00:59,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,012 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:59,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:59,083 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:59,084 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702513261] [2019-10-15 03:00:59,084 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:59,084 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:59,085 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758024559] [2019-10-15 03:00:59,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:59,086 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:59,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:59,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:59,087 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand 4 states. [2019-10-15 03:00:59,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:59,116 INFO L93 Difference]: Finished difference Result 39 states and 55 transitions. [2019-10-15 03:00:59,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:59,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-10-15 03:00:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:59,118 INFO L225 Difference]: With dead ends: 39 [2019-10-15 03:00:59,118 INFO L226 Difference]: Without dead ends: 37 [2019-10-15 03:00:59,119 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:59,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-10-15 03:00:59,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 27. [2019-10-15 03:00:59,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:59,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 38 transitions. [2019-10-15 03:00:59,125 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 38 transitions. Word has length 15 [2019-10-15 03:00:59,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:59,125 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 38 transitions. [2019-10-15 03:00:59,125 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:59,125 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 38 transitions. [2019-10-15 03:00:59,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-15 03:00:59,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:59,129 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:59,130 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:59,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:59,135 INFO L82 PathProgramCache]: Analyzing trace with hash 2079920507, now seen corresponding path program 1 times [2019-10-15 03:00:59,135 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:59,136 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488000724] [2019-10-15 03:00:59,136 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,137 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:59,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:59,204 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:59,205 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488000724] [2019-10-15 03:00:59,205 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:59,205 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:59,205 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1579999790] [2019-10-15 03:00:59,205 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:59,206 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:59,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:59,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:59,206 INFO L87 Difference]: Start difference. First operand 27 states and 38 transitions. Second operand 4 states. [2019-10-15 03:00:59,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:59,239 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-10-15 03:00:59,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:59,240 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-15 03:00:59,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:59,241 INFO L225 Difference]: With dead ends: 37 [2019-10-15 03:00:59,241 INFO L226 Difference]: Without dead ends: 35 [2019-10-15 03:00:59,241 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:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-10-15 03:00:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2019-10-15 03:00:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 37 transitions. [2019-10-15 03:00:59,248 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 37 transitions. Word has length 16 [2019-10-15 03:00:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:59,249 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 37 transitions. [2019-10-15 03:00:59,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:59,249 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2019-10-15 03:00:59,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-15 03:00:59,251 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:59,251 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:59,251 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:59,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:59,252 INFO L82 PathProgramCache]: Analyzing trace with hash 53242027, now seen corresponding path program 1 times [2019-10-15 03:00:59,252 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:59,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398394071] [2019-10-15 03:00:59,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,253 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:59,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:59,321 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:59,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398394071] [2019-10-15 03:00:59,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:59,322 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:59,322 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782078480] [2019-10-15 03:00:59,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:59,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:59,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:59,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:59,326 INFO L87 Difference]: Start difference. First operand 27 states and 37 transitions. Second operand 4 states. [2019-10-15 03:00:59,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:59,352 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2019-10-15 03:00:59,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:59,353 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-15 03:00:59,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:59,353 INFO L225 Difference]: With dead ends: 35 [2019-10-15 03:00:59,354 INFO L226 Difference]: Without dead ends: 33 [2019-10-15 03:00:59,354 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:59,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-15 03:00:59,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 27. [2019-10-15 03:00:59,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-15 03:00:59,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2019-10-15 03:00:59,360 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 17 [2019-10-15 03:00:59,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:59,361 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2019-10-15 03:00:59,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2019-10-15 03:00:59,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-15 03:00:59,362 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 03:00:59,362 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:59,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 03:00:59,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 03:00:59,363 INFO L82 PathProgramCache]: Analyzing trace with hash 1650718928, now seen corresponding path program 1 times [2019-10-15 03:00:59,363 INFO L157 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-15 03:00:59,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008495436] [2019-10-15 03:00:59,363 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,364 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 03:00:59,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 03:00:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 03:00:59,423 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:59,423 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008495436] [2019-10-15 03:00:59,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 03:00:59,424 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 03:00:59,424 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616677774] [2019-10-15 03:00:59,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 03:00:59,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-10-15 03:00:59,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 03:00:59,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-15 03:00:59,429 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand 4 states. [2019-10-15 03:00:59,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 03:00:59,455 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2019-10-15 03:00:59,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 03:00:59,455 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-15 03:00:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 03:00:59,456 INFO L225 Difference]: With dead ends: 29 [2019-10-15 03:00:59,456 INFO L226 Difference]: Without dead ends: 0 [2019-10-15 03:00:59,457 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:59,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-15 03:00:59,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-15 03:00:59,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-15 03:00:59,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-15 03:00:59,458 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-10-15 03:00:59,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 03:00:59,458 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-15 03:00:59,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 03:00:59,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-15 03:00:59,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-15 03:00:59,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-15 03:00:59,487 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-10-15 03:00:59,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:59,487 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-15 03:00:59,487 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-15 03:00:59,487 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point L93-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 149) no Hoare annotation was computed. [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2019-10-15 03:00:59,488 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 147) no Hoare annotation was computed. [2019-10-15 03:00:59,489 INFO L443 ceAbstractionStarter]: For program point L119-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,489 INFO L443 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2019-10-15 03:00:59,489 INFO L446 ceAbstractionStarter]: At program point L145(lines 5 149) the Hoare annotation is: true [2019-10-15 03:00:59,489 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 149) no Hoare annotation was computed. [2019-10-15 03:00:59,494 INFO L443 ceAbstractionStarter]: For program point L104-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,494 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 40) no Hoare annotation was computed. [2019-10-15 03:00:59,494 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,495 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 149) the Hoare annotation is: true [2019-10-15 03:00:59,495 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-10-15 03:00:59,495 INFO L443 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-10-15 03:00:59,495 INFO L443 ceAbstractionStarter]: For program point L114-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,495 INFO L446 ceAbstractionStarter]: At program point L139-1(lines 36 144) the Hoare annotation is: true [2019-10-15 03:00:59,495 INFO L443 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-10-15 03:00:59,495 INFO L443 ceAbstractionStarter]: For program point L140(line 140) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L439 ceAbstractionStarter]: At program point L140-1(lines 5 149) the Hoare annotation is: false [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L99-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L124-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L125(line 125) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L109-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,496 INFO L443 ceAbstractionStarter]: For program point L134-1(lines 36 144) no Hoare annotation was computed. [2019-10-15 03:00:59,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:00:59 BoogieIcfgContainer [2019-10-15 03:00:59,507 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-15 03:00:59,516 INFO L168 Benchmark]: Toolchain (without parser) took 2471.56 ms. Allocated memory was 145.2 MB in the beginning and 236.5 MB in the end (delta: 91.2 MB). Free memory was 101.9 MB in the beginning and 169.7 MB in the end (delta: -67.7 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:59,518 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.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:59,520 INFO L168 Benchmark]: CACSL2BoogieTranslator took 378.53 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 182.1 MB in the end (delta: -80.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:59,521 INFO L168 Benchmark]: Boogie Preprocessor took 40.64 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 179.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:59,521 INFO L168 Benchmark]: RCFGBuilder took 581.58 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 149.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:59,525 INFO L168 Benchmark]: TraceAbstraction took 1466.10 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 148.5 MB in the beginning and 169.7 MB in the end (delta: -21.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-10-15 03:00:59,535 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 145.2 MB. Free memory was 120.2 MB in the beginning and 120.0 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 378.53 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 101.7 MB in the beginning and 182.1 MB in the end (delta: -80.4 MB). Peak memory consumption was 20.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.64 ms. Allocated memory is still 202.9 MB. Free memory was 182.1 MB in the beginning and 179.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 581.58 ms. Allocated memory is still 202.9 MB. Free memory was 179.8 MB in the beginning and 149.2 MB in the end (delta: 30.6 MB). Peak memory consumption was 30.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1466.10 ms. Allocated memory was 202.9 MB in the beginning and 236.5 MB in the end (delta: 33.6 MB). Free memory was 148.5 MB in the beginning and 169.7 MB in the end (delta: -21.1 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 147]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 36]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 1.3s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 341 SDtfs, 254 SDslu, 475 SDs, 0 SdLazy, 81 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred 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, 9 MinimizatonAttempts, 104 StatesRemovedByMinimization, 8 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, 126 NumberOfCodeBlocks, 126 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 117 ConstructedInterpolants, 0 QuantifiedInterpolants, 5685 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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...