/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/locks/test_locks_13.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-07 03:58:15,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-07 03:58:15,014 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-07 03:58:15,025 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-07 03:58:15,026 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-07 03:58:15,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-07 03:58:15,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-07 03:58:15,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-07 03:58:15,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-07 03:58:15,032 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-07 03:58:15,033 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-07 03:58:15,034 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-07 03:58:15,034 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-07 03:58:15,035 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-07 03:58:15,036 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-07 03:58:15,037 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-07 03:58:15,038 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-07 03:58:15,039 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-07 03:58:15,041 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-07 03:58:15,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-07 03:58:15,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-07 03:58:15,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-07 03:58:15,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-07 03:58:15,047 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-07 03:58:15,052 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-07 03:58:15,053 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-07 03:58:15,055 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-07 03:58:15,056 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-07 03:58:15,056 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-07 03:58:15,057 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-07 03:58:15,057 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-07 03:58:15,060 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-07 03:58:15,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-07 03:58:15,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-07 03:58:15,064 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-07 03:58:15,064 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-07 03:58:15,067 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-07 03:58:15,067 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-07 03:58:15,067 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-07 03:58:15,068 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-07 03:58:15,069 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-07 03:58:15,072 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-07 03:58:15,093 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-07 03:58:15,093 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-07 03:58:15,095 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-07 03:58:15,095 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-07 03:58:15,095 INFO L138 SettingsManager]: * Use SBE=true [2019-11-07 03:58:15,095 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-07 03:58:15,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-07 03:58:15,097 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-07 03:58:15,097 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-07 03:58:15,097 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-07 03:58:15,097 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-07 03:58:15,097 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-07 03:58:15,098 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-07 03:58:15,098 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-07 03:58:15,098 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-07 03:58:15,098 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-07 03:58:15,098 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:15,099 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-07 03:58:15,099 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-07 03:58:15,099 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-07 03:58:15,099 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-07 03:58:15,099 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-07 03:58:15,100 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-07 03:58:15,100 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-11-07 03:58:15,364 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-07 03:58:15,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-07 03:58:15,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-07 03:58:15,381 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-07 03:58:15,382 INFO L275 PluginConnector]: CDTParser initialized [2019-11-07 03:58:15,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_13.c [2019-11-07 03:58:15,442 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73131660/ea8f1fe7bc264dd6b4f8a130decfc8d2/FLAG28e05fa43 [2019-11-07 03:58:15,872 INFO L306 CDTParser]: Found 1 translation units. [2019-11-07 03:58:15,872 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_13.c [2019-11-07 03:58:15,887 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73131660/ea8f1fe7bc264dd6b4f8a130decfc8d2/FLAG28e05fa43 [2019-11-07 03:58:16,294 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f73131660/ea8f1fe7bc264dd6b4f8a130decfc8d2 [2019-11-07 03:58:16,320 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-07 03:58:16,322 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-07 03:58:16,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:16,327 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-07 03:58:16,336 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-07 03:58:16,337 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,345 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5915ca50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16, skipping insertion in model container [2019-11-07 03:58:16,345 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,364 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-07 03:58:16,427 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-07 03:58:16,688 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:16,693 INFO L188 MainTranslator]: Completed pre-run [2019-11-07 03:58:16,724 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-07 03:58:16,815 INFO L192 MainTranslator]: Completed translation [2019-11-07 03:58:16,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16 WrapperNode [2019-11-07 03:58:16,816 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-07 03:58:16,817 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-07 03:58:16,817 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-07 03:58:16,817 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-07 03:58:16,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,838 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,838 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,844 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,853 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... [2019-11-07 03:58:16,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-07 03:58:16,858 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-07 03:58:16,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-07 03:58:16,859 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-07 03:58:16,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-07 03:58:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-07 03:58:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-07 03:58:16,921 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-07 03:58:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-07 03:58:16,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-07 03:58:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-07 03:58:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-07 03:58:16,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-07 03:58:17,564 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-07 03:58:17,564 INFO L284 CfgBuilder]: Removed 1 assume(true) statements. [2019-11-07 03:58:17,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:17 BoogieIcfgContainer [2019-11-07 03:58:17,567 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-07 03:58:17,569 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-07 03:58:17,569 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-07 03:58:17,572 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-07 03:58:17,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:58:16" (1/3) ... [2019-11-07 03:58:17,576 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fb6c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:17, skipping insertion in model container [2019-11-07 03:58:17,576 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:58:16" (2/3) ... [2019-11-07 03:58:17,577 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32fb6c39 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:58:17, skipping insertion in model container [2019-11-07 03:58:17,577 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:58:17" (3/3) ... [2019-11-07 03:58:17,591 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_13.c [2019-11-07 03:58:17,602 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-07 03:58:17,613 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-07 03:58:17,625 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-07 03:58:17,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-07 03:58:17,657 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-07 03:58:17,658 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-07 03:58:17,658 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-07 03:58:17,658 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-07 03:58:17,659 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-07 03:58:17,659 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-07 03:58:17,659 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-07 03:58:17,680 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states. [2019-11-07 03:58:17,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-07 03:58:17,686 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:17,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:17,689 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:17,695 INFO L82 PathProgramCache]: Analyzing trace with hash 1709044144, now seen corresponding path program 1 times [2019-11-07 03:58:17,704 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:17,704 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141888864] [2019-11-07 03:58:17,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:17,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:17,908 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141888864] [2019-11-07 03:58:17,910 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:17,911 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:17,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199864286] [2019-11-07 03:58:17,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:17,922 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:17,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:17,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:17,940 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 4 states. [2019-11-07 03:58:18,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,033 INFO L93 Difference]: Finished difference Result 78 states and 130 transitions. [2019-11-07 03:58:18,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2019-11-07 03:58:18,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,049 INFO L225 Difference]: With dead ends: 78 [2019-11-07 03:58:18,049 INFO L226 Difference]: Without dead ends: 63 [2019-11-07 03:58:18,055 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-07 03:58:18,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 35. [2019-11-07 03:58:18,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 59 transitions. [2019-11-07 03:58:18,113 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 59 transitions. Word has length 10 [2019-11-07 03:58:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,114 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 59 transitions. [2019-11-07 03:58:18,114 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,114 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 59 transitions. [2019-11-07 03:58:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-07 03:58:18,115 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,116 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,116 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,117 INFO L82 PathProgramCache]: Analyzing trace with hash 1440973320, now seen corresponding path program 1 times [2019-11-07 03:58:18,117 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,117 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251478867] [2019-11-07 03:58:18,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,203 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251478867] [2019-11-07 03:58:18,203 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,204 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176858479] [2019-11-07 03:58:18,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,207 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,208 INFO L87 Difference]: Start difference. First operand 35 states and 59 transitions. Second operand 4 states. [2019-11-07 03:58:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,248 INFO L93 Difference]: Finished difference Result 63 states and 107 transitions. [2019-11-07 03:58:18,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,250 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-07 03:58:18,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,255 INFO L225 Difference]: With dead ends: 63 [2019-11-07 03:58:18,255 INFO L226 Difference]: Without dead ends: 61 [2019-11-07 03:58:18,257 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-07 03:58:18,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 35. [2019-11-07 03:58:18,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 58 transitions. [2019-11-07 03:58:18,272 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 58 transitions. Word has length 11 [2019-11-07 03:58:18,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,272 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 58 transitions. [2019-11-07 03:58:18,272 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,273 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 58 transitions. [2019-11-07 03:58:18,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-11-07 03:58:18,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,274 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,274 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1720712709, now seen corresponding path program 1 times [2019-11-07 03:58:18,275 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,275 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107822858] [2019-11-07 03:58:18,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,363 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107822858] [2019-11-07 03:58:18,363 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,363 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114540409] [2019-11-07 03:58:18,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,364 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,365 INFO L87 Difference]: Start difference. First operand 35 states and 58 transitions. Second operand 4 states. [2019-11-07 03:58:18,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,392 INFO L93 Difference]: Finished difference Result 61 states and 102 transitions. [2019-11-07 03:58:18,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,393 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-11-07 03:58:18,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,394 INFO L225 Difference]: With dead ends: 61 [2019-11-07 03:58:18,394 INFO L226 Difference]: Without dead ends: 59 [2019-11-07 03:58:18,395 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-07 03:58:18,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 35. [2019-11-07 03:58:18,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 57 transitions. [2019-11-07 03:58:18,401 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 57 transitions. Word has length 12 [2019-11-07 03:58:18,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,402 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 57 transitions. [2019-11-07 03:58:18,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 57 transitions. [2019-11-07 03:58:18,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-07 03:58:18,403 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,403 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,403 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1802699517, now seen corresponding path program 1 times [2019-11-07 03:58:18,404 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,404 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665080895] [2019-11-07 03:58:18,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,456 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665080895] [2019-11-07 03:58:18,456 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,456 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580878295] [2019-11-07 03:58:18,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,457 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,458 INFO L87 Difference]: Start difference. First operand 35 states and 57 transitions. Second operand 4 states. [2019-11-07 03:58:18,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,493 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2019-11-07 03:58:18,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,494 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-07 03:58:18,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,495 INFO L225 Difference]: With dead ends: 59 [2019-11-07 03:58:18,495 INFO L226 Difference]: Without dead ends: 57 [2019-11-07 03:58:18,495 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2019-11-07 03:58:18,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2019-11-07 03:58:18,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 56 transitions. [2019-11-07 03:58:18,501 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 56 transitions. Word has length 13 [2019-11-07 03:58:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,502 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 56 transitions. [2019-11-07 03:58:18,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,503 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 56 transitions. [2019-11-07 03:58:18,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-07 03:58:18,504 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,504 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,504 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,505 INFO L82 PathProgramCache]: Analyzing trace with hash 49323610, now seen corresponding path program 1 times [2019-11-07 03:58:18,505 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,506 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919105857] [2019-11-07 03:58:18,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,577 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919105857] [2019-11-07 03:58:18,577 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,577 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721103688] [2019-11-07 03:58:18,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,579 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,579 INFO L87 Difference]: Start difference. First operand 35 states and 56 transitions. Second operand 4 states. [2019-11-07 03:58:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,607 INFO L93 Difference]: Finished difference Result 57 states and 92 transitions. [2019-11-07 03:58:18,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,608 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-07 03:58:18,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,609 INFO L225 Difference]: With dead ends: 57 [2019-11-07 03:58:18,609 INFO L226 Difference]: Without dead ends: 55 [2019-11-07 03:58:18,610 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-11-07 03:58:18,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 35. [2019-11-07 03:58:18,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 55 transitions. [2019-11-07 03:58:18,620 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 55 transitions. Word has length 14 [2019-11-07 03:58:18,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,621 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 55 transitions. [2019-11-07 03:58:18,621 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,621 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 55 transitions. [2019-11-07 03:58:18,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-07 03:58:18,622 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,623 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,623 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1529245682, now seen corresponding path program 1 times [2019-11-07 03:58:18,624 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,624 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846506459] [2019-11-07 03:58:18,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,705 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846506459] [2019-11-07 03:58:18,705 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,706 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,706 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766936970] [2019-11-07 03:58:18,706 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,707 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,709 INFO L87 Difference]: Start difference. First operand 35 states and 55 transitions. Second operand 4 states. [2019-11-07 03:58:18,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,739 INFO L93 Difference]: Finished difference Result 55 states and 87 transitions. [2019-11-07 03:58:18,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,740 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-07 03:58:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,741 INFO L225 Difference]: With dead ends: 55 [2019-11-07 03:58:18,741 INFO L226 Difference]: Without dead ends: 53 [2019-11-07 03:58:18,742 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-07 03:58:18,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 35. [2019-11-07 03:58:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 54 transitions. [2019-11-07 03:58:18,747 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 54 transitions. Word has length 15 [2019-11-07 03:58:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,747 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 54 transitions. [2019-11-07 03:58:18,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,748 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 54 transitions. [2019-11-07 03:58:18,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-07 03:58:18,748 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,749 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,749 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,749 INFO L82 PathProgramCache]: Analyzing trace with hash 162189999, now seen corresponding path program 1 times [2019-11-07 03:58:18,749 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,750 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063631961] [2019-11-07 03:58:18,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,794 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063631961] [2019-11-07 03:58:18,794 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,794 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112642782] [2019-11-07 03:58:18,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,795 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,796 INFO L87 Difference]: Start difference. First operand 35 states and 54 transitions. Second operand 4 states. [2019-11-07 03:58:18,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,828 INFO L93 Difference]: Finished difference Result 53 states and 82 transitions. [2019-11-07 03:58:18,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,829 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-07 03:58:18,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,831 INFO L225 Difference]: With dead ends: 53 [2019-11-07 03:58:18,831 INFO L226 Difference]: Without dead ends: 51 [2019-11-07 03:58:18,831 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-11-07 03:58:18,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 35. [2019-11-07 03:58:18,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 53 transitions. [2019-11-07 03:58:18,839 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 53 transitions. Word has length 16 [2019-11-07 03:58:18,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,843 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 53 transitions. [2019-11-07 03:58:18,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,843 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 53 transitions. [2019-11-07 03:58:18,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-07 03:58:18,844 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,844 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,844 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,845 INFO L82 PathProgramCache]: Analyzing trace with hash 733137127, now seen corresponding path program 1 times [2019-11-07 03:58:18,845 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,845 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956892477] [2019-11-07 03:58:18,845 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,898 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956892477] [2019-11-07 03:58:18,898 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,898 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056638155] [2019-11-07 03:58:18,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,899 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,900 INFO L87 Difference]: Start difference. First operand 35 states and 53 transitions. Second operand 4 states. [2019-11-07 03:58:18,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,921 INFO L93 Difference]: Finished difference Result 51 states and 77 transitions. [2019-11-07 03:58:18,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:18,921 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-07 03:58:18,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:18,922 INFO L225 Difference]: With dead ends: 51 [2019-11-07 03:58:18,923 INFO L226 Difference]: Without dead ends: 49 [2019-11-07 03:58:18,923 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-07 03:58:18,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2019-11-07 03:58:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:18,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 52 transitions. [2019-11-07 03:58:18,927 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 52 transitions. Word has length 17 [2019-11-07 03:58:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:18,927 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 52 transitions. [2019-11-07 03:58:18,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:18,928 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 52 transitions. [2019-11-07 03:58:18,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-07 03:58:18,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:18,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:18,929 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:18,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:18,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1252629252, now seen corresponding path program 1 times [2019-11-07 03:58:18,929 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:18,929 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944331282] [2019-11-07 03:58:18,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:18,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:18,977 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944331282] [2019-11-07 03:58:18,977 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:18,977 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:18,977 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792815502] [2019-11-07 03:58:18,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:18,979 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:18,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:18,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:18,980 INFO L87 Difference]: Start difference. First operand 35 states and 52 transitions. Second operand 4 states. [2019-11-07 03:58:18,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:18,999 INFO L93 Difference]: Finished difference Result 49 states and 72 transitions. [2019-11-07 03:58:19,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:19,000 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-07 03:58:19,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:19,001 INFO L225 Difference]: With dead ends: 49 [2019-11-07 03:58:19,001 INFO L226 Difference]: Without dead ends: 47 [2019-11-07 03:58:19,001 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-11-07 03:58:19,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 35. [2019-11-07 03:58:19,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:19,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 51 transitions. [2019-11-07 03:58:19,004 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 51 transitions. Word has length 18 [2019-11-07 03:58:19,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:19,009 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 51 transitions. [2019-11-07 03:58:19,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:19,009 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 51 transitions. [2019-11-07 03:58:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-07 03:58:19,010 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:19,010 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:19,010 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:19,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:19,011 INFO L82 PathProgramCache]: Analyzing trace with hash 177016284, now seen corresponding path program 1 times [2019-11-07 03:58:19,011 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:19,011 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523189617] [2019-11-07 03:58:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:19,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:19,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:19,062 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523189617] [2019-11-07 03:58:19,063 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:19,063 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:19,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132693617] [2019-11-07 03:58:19,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:19,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:19,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:19,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,065 INFO L87 Difference]: Start difference. First operand 35 states and 51 transitions. Second operand 4 states. [2019-11-07 03:58:19,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:19,090 INFO L93 Difference]: Finished difference Result 47 states and 67 transitions. [2019-11-07 03:58:19,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:19,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-11-07 03:58:19,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:19,091 INFO L225 Difference]: With dead ends: 47 [2019-11-07 03:58:19,091 INFO L226 Difference]: Without dead ends: 45 [2019-11-07 03:58:19,097 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-11-07 03:58:19,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 35. [2019-11-07 03:58:19,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:19,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 50 transitions. [2019-11-07 03:58:19,100 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 50 transitions. Word has length 19 [2019-11-07 03:58:19,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:19,100 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 50 transitions. [2019-11-07 03:58:19,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:19,100 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 50 transitions. [2019-11-07 03:58:19,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-07 03:58:19,101 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:19,101 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:19,101 INFO L410 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:19,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:19,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1192752985, now seen corresponding path program 1 times [2019-11-07 03:58:19,102 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:19,102 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647434484] [2019-11-07 03:58:19,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:19,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:19,139 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647434484] [2019-11-07 03:58:19,140 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:19,140 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:19,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398447975] [2019-11-07 03:58:19,140 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:19,141 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:19,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:19,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,141 INFO L87 Difference]: Start difference. First operand 35 states and 50 transitions. Second operand 4 states. [2019-11-07 03:58:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:19,158 INFO L93 Difference]: Finished difference Result 45 states and 62 transitions. [2019-11-07 03:58:19,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:19,159 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-11-07 03:58:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:19,159 INFO L225 Difference]: With dead ends: 45 [2019-11-07 03:58:19,160 INFO L226 Difference]: Without dead ends: 43 [2019-11-07 03:58:19,160 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-07 03:58:19,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 35. [2019-11-07 03:58:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:19,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 49 transitions. [2019-11-07 03:58:19,163 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 49 transitions. Word has length 20 [2019-11-07 03:58:19,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:19,164 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 49 transitions. [2019-11-07 03:58:19,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:19,164 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 49 transitions. [2019-11-07 03:58:19,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-07 03:58:19,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:19,165 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:19,165 INFO L410 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:19,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1679147311, now seen corresponding path program 1 times [2019-11-07 03:58:19,166 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:19,166 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635448700] [2019-11-07 03:58:19,166 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:19,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:19,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:19,199 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635448700] [2019-11-07 03:58:19,199 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:19,199 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:19,199 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173546043] [2019-11-07 03:58:19,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:19,200 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:19,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:19,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,201 INFO L87 Difference]: Start difference. First operand 35 states and 49 transitions. Second operand 4 states. [2019-11-07 03:58:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:19,217 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2019-11-07 03:58:19,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:19,218 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-11-07 03:58:19,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:19,219 INFO L225 Difference]: With dead ends: 43 [2019-11-07 03:58:19,219 INFO L226 Difference]: Without dead ends: 41 [2019-11-07 03:58:19,220 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-07 03:58:19,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2019-11-07 03:58:19,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-11-07 03:58:19,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2019-11-07 03:58:19,223 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 21 [2019-11-07 03:58:19,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:19,223 INFO L462 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2019-11-07 03:58:19,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:19,223 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2019-11-07 03:58:19,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-07 03:58:19,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-07 03:58:19,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-07 03:58:19,225 INFO L410 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-07 03:58:19,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-07 03:58:19,225 INFO L82 PathProgramCache]: Analyzing trace with hash -513742930, now seen corresponding path program 1 times [2019-11-07 03:58:19,225 INFO L161 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-07 03:58:19,225 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391936668] [2019-11-07 03:58:19,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-07 03:58:19,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-07 03:58:19,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-07 03:58:19,259 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391936668] [2019-11-07 03:58:19,260 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-07 03:58:19,260 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-07 03:58:19,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877490880] [2019-11-07 03:58:19,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-07 03:58:19,261 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-07 03:58:19,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-07 03:58:19,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,262 INFO L87 Difference]: Start difference. First operand 35 states and 48 transitions. Second operand 4 states. [2019-11-07 03:58:19,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-07 03:58:19,281 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions. [2019-11-07 03:58:19,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-07 03:58:19,281 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2019-11-07 03:58:19,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-07 03:58:19,282 INFO L225 Difference]: With dead ends: 37 [2019-11-07 03:58:19,282 INFO L226 Difference]: Without dead ends: 0 [2019-11-07 03:58:19,283 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-07 03:58:19,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-07 03:58:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-07 03:58:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-07 03:58:19,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-07 03:58:19,284 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-07 03:58:19,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-07 03:58:19,284 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-07 03:58:19,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-07 03:58:19,284 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-07 03:58:19,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-07 03:58:19,290 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-07 03:58:19,310 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2019-11-07 03:58:19,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:19,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-07 03:58:19,311 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-07 03:58:19,311 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-07 03:58:19,311 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-07 03:58:19,311 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 4 205) no Hoare annotation was computed. [2019-11-07 03:58:19,311 INFO L443 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L446 ceAbstractionStarter]: At program point L201(lines 5 205) the Hoare annotation is: true [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point L135-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point L185-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 4 205) no Hoare annotation was computed. [2019-11-07 03:58:19,312 INFO L443 ceAbstractionStarter]: For program point L170-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L155-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L140-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L190-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2019-11-07 03:58:19,313 INFO L443 ceAbstractionStarter]: For program point L191(line 191) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L175-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L176(line 176) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L160-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L161(line 161) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L145-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,314 INFO L446 ceAbstractionStarter]: At program point L195-1(lines 48 200) the Hoare annotation is: true [2019-11-07 03:58:19,314 INFO L443 ceAbstractionStarter]: For program point L129-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 4 205) the Hoare annotation is: true [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L146(line 146) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L439 ceAbstractionStarter]: At program point L196-1(lines 5 205) the Hoare annotation is: false [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L180-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L165-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,315 INFO L443 ceAbstractionStarter]: For program point L50(lines 50 52) no Hoare annotation was computed. [2019-11-07 03:58:19,316 INFO L443 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-11-07 03:58:19,316 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 203) no Hoare annotation was computed. [2019-11-07 03:58:19,316 INFO L443 ceAbstractionStarter]: For program point L150-1(lines 48 200) no Hoare annotation was computed. [2019-11-07 03:58:19,325 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:58:19 BoogieIcfgContainer [2019-11-07 03:58:19,325 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-07 03:58:19,328 INFO L168 Benchmark]: Toolchain (without parser) took 3005.23 ms. Allocated memory was 137.9 MB in the beginning and 233.3 MB in the end (delta: 95.4 MB). Free memory was 101.1 MB in the beginning and 113.0 MB in the end (delta: -11.9 MB). Peak memory consumption was 83.5 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,329 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,330 INFO L168 Benchmark]: CACSL2BoogieTranslator took 489.95 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 180.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,331 INFO L168 Benchmark]: Boogie Preprocessor took 41.47 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 177.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,332 INFO L168 Benchmark]: RCFGBuilder took 708.79 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 135.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,332 INFO L168 Benchmark]: TraceAbstraction took 1756.53 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 135.0 MB in the beginning and 113.0 MB in the end (delta: 21.9 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. [2019-11-07 03:58:19,336 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 137.9 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 489.95 ms. Allocated memory was 137.9 MB in the beginning and 200.8 MB in the end (delta: 62.9 MB). Free memory was 100.9 MB in the beginning and 180.0 MB in the end (delta: -79.1 MB). Peak memory consumption was 24.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.47 ms. Allocated memory is still 200.8 MB. Free memory was 180.0 MB in the beginning and 177.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.79 ms. Allocated memory is still 200.8 MB. Free memory was 177.7 MB in the beginning and 135.6 MB in the end (delta: 42.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 1756.53 ms. Allocated memory was 200.8 MB in the beginning and 233.3 MB in the end (delta: 32.5 MB). Free memory was 135.0 MB in the beginning and 113.0 MB in the end (delta: 21.9 MB). Peak memory consumption was 54.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 203]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 48]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 40 locations, 1 error locations. Result: SAFE, OverallTime: 1.6s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 671 SDtfs, 522 SDslu, 969 SDs, 0 SdLazy, 117 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 204 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 10 NumberOfFragments, 7 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 208 NumberOfCodeBlocks, 208 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 195 ConstructedInterpolants, 0 QuantifiedInterpolants, 12779 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...