/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/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/locks/test_locks_7.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 22:06:53,729 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 22:06:53,731 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 22:06:53,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 22:06:53,749 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 22:06:53,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 22:06:53,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 22:06:53,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 22:06:53,767 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 22:06:53,769 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 22:06:53,771 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 22:06:53,773 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 22:06:53,773 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 22:06:53,776 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 22:06:53,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 22:06:53,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 22:06:53,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 22:06:53,784 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 22:06:53,789 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 22:06:53,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 22:06:53,793 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 22:06:53,793 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 22:06:53,797 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 22:06:53,797 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 22:06:53,800 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 22:06:53,801 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 22:06:53,801 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 22:06:53,803 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 22:06:53,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 22:06:53,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 22:06:53,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 22:06:53,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 22:06:53,808 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 22:06:53,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 22:06:53,810 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 22:06:53,810 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 22:06:53,811 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 22:06:53,811 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 22:06:53,811 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 22:06:53,815 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 22:06:53,816 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 22:06:53,817 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-23 22:06:53,836 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 22:06:53,836 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 22:06:53,838 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 22:06:53,838 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 22:06:53,838 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 22:06:53,838 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 22:06:53,839 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 22:06:53,839 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 22:06:53,839 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 22:06:53,839 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 22:06:53,839 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 22:06:53,840 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 22:06:53,840 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 22:06:53,840 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 22:06:53,840 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 22:06:53,840 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 22:06:53,841 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 22:06:53,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 22:06:53,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 22:06:53,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 22:06:53,841 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 22:06:53,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 22:06:53,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 22:06:53,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 22:06:53,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 22:06:53,842 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 22:06:53,843 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 22:06:53,843 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 22:06:53,843 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 22:06:53,843 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 22:06:54,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 22:06:54,143 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 22:06:54,147 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 22:06:54,148 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 22:06:54,148 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 22:06:54,149 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/locks/test_locks_7.c [2019-11-23 22:06:54,221 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a36358/45ad728c720244c1a265b63244e6c78c/FLAG7da19af7c [2019-11-23 22:06:54,672 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 22:06:54,673 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/locks/test_locks_7.c [2019-11-23 22:06:54,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a36358/45ad728c720244c1a265b63244e6c78c/FLAG7da19af7c [2019-11-23 22:06:55,035 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/513a36358/45ad728c720244c1a265b63244e6c78c [2019-11-23 22:06:55,044 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 22:06:55,046 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 22:06:55,047 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:55,047 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 22:06:55,050 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 22:06:55,051 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,054 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e534208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55, skipping insertion in model container [2019-11-23 22:06:55,054 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,062 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 22:06:55,084 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 22:06:55,289 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:55,293 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 22:06:55,313 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 22:06:55,328 INFO L208 MainTranslator]: Completed translation [2019-11-23 22:06:55,328 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55 WrapperNode [2019-11-23 22:06:55,328 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 22:06:55,329 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:55,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 22:06:55,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 22:06:55,336 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,342 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,443 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 22:06:55,443 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 22:06:55,444 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 22:06:55,444 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 22:06:55,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,455 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,464 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,465 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (1/1) ... [2019-11-23 22:06:55,467 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 22:06:55,468 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 22:06:55,468 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 22:06:55,468 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 22:06:55,469 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (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-23 22:06:55,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 22:06:55,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 22:06:55,836 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 22:06:55,837 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-23 22:06:55,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:55 BoogieIcfgContainer [2019-11-23 22:06:55,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 22:06:55,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 22:06:55,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 22:06:55,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 22:06:55,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 10:06:55" (1/3) ... [2019-11-23 22:06:55,843 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:55, skipping insertion in model container [2019-11-23 22:06:55,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 10:06:55" (2/3) ... [2019-11-23 22:06:55,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e8568 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 10:06:55, skipping insertion in model container [2019-11-23 22:06:55,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 10:06:55" (3/3) ... [2019-11-23 22:06:55,845 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-23 22:06:55,855 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 22:06:55,861 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 22:06:55,871 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 22:06:55,896 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 22:06:55,896 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 22:06:55,896 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 22:06:55,896 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 22:06:55,896 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 22:06:55,897 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 22:06:55,897 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 22:06:55,897 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 22:06:55,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-23 22:06:55,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:06:55,921 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:55,922 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:55,923 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:55,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:55,929 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-11-23 22:06:55,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:55,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521172418] [2019-11-23 22:06:55,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,094 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-23 22:06:56,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521172418] [2019-11-23 22:06:56,096 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,096 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,097 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687972543] [2019-11-23 22:06:56,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,102 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,119 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-23 22:06:56,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,186 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-11-23 22:06:56,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:06:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,198 INFO L225 Difference]: With dead ends: 64 [2019-11-23 22:06:56,198 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 22:06:56,201 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 22:06:56,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-11-23 22:06:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-23 22:06:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-11-23 22:06:56,243 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-11-23 22:06:56,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,243 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-11-23 22:06:56,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,244 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-11-23 22:06:56,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-23 22:06:56,245 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,245 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,245 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,246 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-11-23 22:06:56,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567200754] [2019-11-23 22:06:56,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,303 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-23 22:06:56,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567200754] [2019-11-23 22:06:56,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,305 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406960061] [2019-11-23 22:06:56,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,307 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,308 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-11-23 22:06:56,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,349 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-11-23 22:06:56,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-23 22:06:56,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,351 INFO L225 Difference]: With dead ends: 83 [2019-11-23 22:06:56,351 INFO L226 Difference]: Without dead ends: 50 [2019-11-23 22:06:56,353 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-23 22:06:56,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-23 22:06:56,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-23 22:06:56,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-11-23 22:06:56,361 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-11-23 22:06:56,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,361 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-11-23 22:06:56,361 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,362 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-11-23 22:06:56,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:06:56,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,363 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,363 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,364 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-11-23 22:06:56,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,364 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049803645] [2019-11-23 22:06:56,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,403 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-23 22:06:56,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049803645] [2019-11-23 22:06:56,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836625407] [2019-11-23 22:06:56,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,407 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-11-23 22:06:56,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,434 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-11-23 22:06:56,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:06:56,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,436 INFO L225 Difference]: With dead ends: 77 [2019-11-23 22:06:56,437 INFO L226 Difference]: Without dead ends: 53 [2019-11-23 22:06:56,437 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-23 22:06:56,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-23 22:06:56,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-23 22:06:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-11-23 22:06:56,446 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-11-23 22:06:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,447 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-11-23 22:06:56,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-11-23 22:06:56,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:06:56,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,448 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-11-23 22:06:56,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306094137] [2019-11-23 22:06:56,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,491 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-23 22:06:56,492 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306094137] [2019-11-23 22:06:56,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368627765] [2019-11-23 22:06:56,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,495 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-11-23 22:06:56,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,519 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-11-23 22:06:56,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:06:56,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,521 INFO L225 Difference]: With dead ends: 96 [2019-11-23 22:06:56,521 INFO L226 Difference]: Without dead ends: 94 [2019-11-23 22:06:56,522 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-23 22:06:56,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-11-23 22:06:56,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-23 22:06:56,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-11-23 22:06:56,534 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-11-23 22:06:56,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,535 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-11-23 22:06:56,535 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,535 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-11-23 22:06:56,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-23 22:06:56,536 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,536 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,536 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-11-23 22:06:56,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972873109] [2019-11-23 22:06:56,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,570 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-23 22:06:56,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972873109] [2019-11-23 22:06:56,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,571 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980828468] [2019-11-23 22:06:56,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,573 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-11-23 22:06:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,604 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-11-23 22:06:56,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-23 22:06:56,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,606 INFO L225 Difference]: With dead ends: 160 [2019-11-23 22:06:56,607 INFO L226 Difference]: Without dead ends: 96 [2019-11-23 22:06:56,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-23 22:06:56,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-23 22:06:56,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-23 22:06:56,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-11-23 22:06:56,620 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-11-23 22:06:56,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,620 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-11-23 22:06:56,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,620 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-11-23 22:06:56,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:56,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,621 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,622 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-11-23 22:06:56,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667919585] [2019-11-23 22:06:56,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,664 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-23 22:06:56,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667919585] [2019-11-23 22:06:56,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59355106] [2019-11-23 22:06:56,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,666 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-11-23 22:06:56,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,702 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-11-23 22:06:56,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,703 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:56,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,706 INFO L225 Difference]: With dead ends: 143 [2019-11-23 22:06:56,706 INFO L226 Difference]: Without dead ends: 98 [2019-11-23 22:06:56,708 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-23 22:06:56,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-23 22:06:56,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-23 22:06:56,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-11-23 22:06:56,739 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-11-23 22:06:56,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,739 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-11-23 22:06:56,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,742 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-11-23 22:06:56,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:56,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,744 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,744 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-11-23 22:06:56,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,745 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308184109] [2019-11-23 22:06:56,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,811 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-23 22:06:56,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308184109] [2019-11-23 22:06:56,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,818 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761478629] [2019-11-23 22:06:56,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,823 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-11-23 22:06:56,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,854 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-11-23 22:06:56,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,854 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:56,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,856 INFO L225 Difference]: With dead ends: 272 [2019-11-23 22:06:56,856 INFO L226 Difference]: Without dead ends: 182 [2019-11-23 22:06:56,857 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-23 22:06:56,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-23 22:06:56,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:06:56,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-11-23 22:06:56,877 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-11-23 22:06:56,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,877 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-11-23 22:06:56,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,878 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-11-23 22:06:56,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-23 22:06:56,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,881 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,882 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-11-23 22:06:56,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561622282] [2019-11-23 22:06:56,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:56,938 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-23 22:06:56,939 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561622282] [2019-11-23 22:06:56,940 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:56,940 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:56,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38720188] [2019-11-23 22:06:56,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:56,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:56,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:56,941 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,942 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-11-23 22:06:56,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:56,968 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-11-23 22:06:56,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:56,968 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-23 22:06:56,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:56,970 INFO L225 Difference]: With dead ends: 224 [2019-11-23 22:06:56,970 INFO L226 Difference]: Without dead ends: 222 [2019-11-23 22:06:56,971 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:56,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-23 22:06:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-11-23 22:06:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-23 22:06:56,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-11-23 22:06:56,982 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-11-23 22:06:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:56,982 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-11-23 22:06:56,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:56,983 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-11-23 22:06:56,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:56,984 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:56,984 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:56,985 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:56,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:56,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-11-23 22:06:56,985 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:56,986 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706585949] [2019-11-23 22:06:56,986 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,042 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-23 22:06:57,043 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706585949] [2019-11-23 22:06:57,043 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,043 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989344989] [2019-11-23 22:06:57,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,045 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-11-23 22:06:57,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,073 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-11-23 22:06:57,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,074 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:57,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,076 INFO L225 Difference]: With dead ends: 324 [2019-11-23 22:06:57,076 INFO L226 Difference]: Without dead ends: 322 [2019-11-23 22:06:57,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-23 22:06:57,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-11-23 22:06:57,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-23 22:06:57,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-11-23 22:06:57,088 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-11-23 22:06:57,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,089 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-11-23 22:06:57,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,089 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-11-23 22:06:57,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-23 22:06:57,090 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,090 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,091 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-11-23 22:06:57,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,092 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390914637] [2019-11-23 22:06:57,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,125 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-23 22:06:57,126 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390914637] [2019-11-23 22:06:57,126 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,126 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646261963] [2019-11-23 22:06:57,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,127 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,127 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-11-23 22:06:57,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,176 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-11-23 22:06:57,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,177 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-23 22:06:57,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,179 INFO L225 Difference]: With dead ends: 596 [2019-11-23 22:06:57,180 INFO L226 Difference]: Without dead ends: 346 [2019-11-23 22:06:57,182 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-23 22:06:57,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-11-23 22:06:57,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-23 22:06:57,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-11-23 22:06:57,212 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-11-23 22:06:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,213 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-11-23 22:06:57,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-11-23 22:06:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:57,214 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,214 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,217 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,217 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-11-23 22:06:57,217 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,218 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642085493] [2019-11-23 22:06:57,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,274 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-23 22:06:57,275 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642085493] [2019-11-23 22:06:57,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,276 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816438053] [2019-11-23 22:06:57,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,277 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-11-23 22:06:57,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,304 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-11-23 22:06:57,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:57,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,306 INFO L225 Difference]: With dead ends: 524 [2019-11-23 22:06:57,306 INFO L226 Difference]: Without dead ends: 358 [2019-11-23 22:06:57,307 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-23 22:06:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-23 22:06:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-23 22:06:57,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-11-23 22:06:57,329 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-11-23 22:06:57,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,329 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-11-23 22:06:57,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,330 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-11-23 22:06:57,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:57,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,331 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-11-23 22:06:57,332 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499456500] [2019-11-23 22:06:57,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,359 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-23 22:06:57,359 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499456500] [2019-11-23 22:06:57,359 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,360 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793094854] [2019-11-23 22:06:57,360 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,360 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,362 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-11-23 22:06:57,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,383 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-11-23 22:06:57,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,384 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:57,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,387 INFO L225 Difference]: With dead ends: 616 [2019-11-23 22:06:57,387 INFO L226 Difference]: Without dead ends: 614 [2019-11-23 22:06:57,388 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-23 22:06:57,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-11-23 22:06:57,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-23 22:06:57,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-11-23 22:06:57,406 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-11-23 22:06:57,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,407 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-11-23 22:06:57,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,407 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-11-23 22:06:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-23 22:06:57,408 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,408 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 22:06:57,408 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,409 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-11-23 22:06:57,409 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,409 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234857321] [2019-11-23 22:06:57,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,436 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-23 22:06:57,436 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234857321] [2019-11-23 22:06:57,438 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,438 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,438 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049253857] [2019-11-23 22:06:57,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,439 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-11-23 22:06:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,464 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-11-23 22:06:57,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-23 22:06:57,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,468 INFO L225 Difference]: With dead ends: 1176 [2019-11-23 22:06:57,468 INFO L226 Difference]: Without dead ends: 678 [2019-11-23 22:06:57,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-11-23 22:06:57,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-11-23 22:06:57,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-23 22:06:57,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-11-23 22:06:57,491 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-11-23 22:06:57,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,491 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-11-23 22:06:57,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-11-23 22:06:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:57,493 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,493 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-23 22:06:57,493 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,493 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-11-23 22:06:57,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021063397] [2019-11-23 22:06:57,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,531 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-23 22:06:57,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021063397] [2019-11-23 22:06:57,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669134708] [2019-11-23 22:06:57,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,534 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-11-23 22:06:57,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,559 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-11-23 22:06:57,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,559 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:57,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,562 INFO L225 Difference]: With dead ends: 1016 [2019-11-23 22:06:57,563 INFO L226 Difference]: Without dead ends: 694 [2019-11-23 22:06:57,564 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-23 22:06:57,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-23 22:06:57,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-23 22:06:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-11-23 22:06:57,586 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-11-23 22:06:57,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,587 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-11-23 22:06:57,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,588 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-11-23 22:06:57,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:57,589 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,589 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-23 22:06:57,590 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-11-23 22:06:57,591 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1394346269] [2019-11-23 22:06:57,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,620 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-23 22:06:57,620 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1394346269] [2019-11-23 22:06:57,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42439383] [2019-11-23 22:06:57,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,622 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-11-23 22:06:57,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,648 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-11-23 22:06:57,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,648 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:57,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,654 INFO L225 Difference]: With dead ends: 1160 [2019-11-23 22:06:57,654 INFO L226 Difference]: Without dead ends: 1158 [2019-11-23 22:06:57,654 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-23 22:06:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-11-23 22:06:57,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-23 22:06:57,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-11-23 22:06:57,686 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-11-23 22:06:57,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,687 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-11-23 22:06:57,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,687 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-11-23 22:06:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-23 22:06:57,689 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,689 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-23 22:06:57,690 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,690 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-11-23 22:06:57,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [993730504] [2019-11-23 22:06:57,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,707 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-23 22:06:57,707 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [993730504] [2019-11-23 22:06:57,708 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,708 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,708 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388441001] [2019-11-23 22:06:57,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,709 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-11-23 22:06:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,762 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-11-23 22:06:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,764 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-23 22:06:57,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,772 INFO L225 Difference]: With dead ends: 2312 [2019-11-23 22:06:57,772 INFO L226 Difference]: Without dead ends: 1318 [2019-11-23 22:06:57,775 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-23 22:06:57,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-11-23 22:06:57,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-11-23 22:06:57,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-11-23 22:06:57,875 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-11-23 22:06:57,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:57,875 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-11-23 22:06:57,876 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:57,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-11-23 22:06:57,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:57,879 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:57,879 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-23 22:06:57,880 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:57,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:57,880 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-11-23 22:06:57,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:57,881 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667445942] [2019-11-23 22:06:57,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:57,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:57,899 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-23 22:06:57,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667445942] [2019-11-23 22:06:57,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:57,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:57,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890074892] [2019-11-23 22:06:57,900 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:57,901 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:57,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:57,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,901 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-11-23 22:06:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:57,944 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-11-23 22:06:57,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:57,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:57,951 INFO L225 Difference]: With dead ends: 1976 [2019-11-23 22:06:57,952 INFO L226 Difference]: Without dead ends: 1350 [2019-11-23 22:06:57,953 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:57,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-23 22:06:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-23 22:06:58,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-23 22:06:58,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-11-23 22:06:58,015 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-11-23 22:06:58,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,015 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-11-23 22:06:58,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-11-23 22:06:58,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:58,017 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,018 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-23 22:06:58,018 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,018 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-11-23 22:06:58,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949257835] [2019-11-23 22:06:58,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,034 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-23 22:06:58,035 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949257835] [2019-11-23 22:06:58,035 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,035 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046412051] [2019-11-23 22:06:58,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,037 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-11-23 22:06:58,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,094 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-11-23 22:06:58,095 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:58,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,108 INFO L225 Difference]: With dead ends: 2182 [2019-11-23 22:06:58,109 INFO L226 Difference]: Without dead ends: 2180 [2019-11-23 22:06:58,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-11-23 22:06:58,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-11-23 22:06:58,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-23 22:06:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-11-23 22:06:58,171 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-11-23 22:06:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,171 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-11-23 22:06:58,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,171 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-11-23 22:06:58,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-23 22:06:58,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 22:06:58,175 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-23 22:06:58,175 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 22:06:58,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 22:06:58,175 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-11-23 22:06:58,176 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 22:06:58,176 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154842799] [2019-11-23 22:06:58,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 22:06:58,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 22:06:58,190 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-23 22:06:58,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154842799] [2019-11-23 22:06:58,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 22:06:58,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 22:06:58,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230124017] [2019-11-23 22:06:58,191 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 22:06:58,191 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 22:06:58,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 22:06:58,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,192 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-11-23 22:06:58,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 22:06:58,250 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-11-23 22:06:58,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 22:06:58,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-23 22:06:58,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 22:06:58,251 INFO L225 Difference]: With dead ends: 4548 [2019-11-23 22:06:58,251 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 22:06:58,256 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 22:06:58,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 22:06:58,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 22:06:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 22:06:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 22:06:58,257 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-23 22:06:58,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 22:06:58,257 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 22:06:58,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 22:06:58,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 22:06:58,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 22:06:58,262 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 22:06:58,281 INFO L444 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-23 22:06:58,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 22:06:58,281 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 22:06:58,281 INFO L444 ceAbstractionStarter]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,281 INFO L447 ceAbstractionStarter]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-23 22:06:58,281 INFO L447 ceAbstractionStarter]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L440 ceAbstractionStarter]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,282 INFO L444 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-23 22:06:58,283 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 22:06:58,284 INFO L444 ceAbstractionStarter]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,284 INFO L444 ceAbstractionStarter]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,284 INFO L444 ceAbstractionStarter]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,284 INFO L444 ceAbstractionStarter]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-23 22:06:58,285 INFO L444 ceAbstractionStarter]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,285 INFO L447 ceAbstractionStarter]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-23 22:06:58,285 INFO L444 ceAbstractionStarter]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-23 22:06:58,285 INFO L444 ceAbstractionStarter]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,285 INFO L444 ceAbstractionStarter]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-23 22:06:58,295 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 10:06:58 BoogieIcfgContainer [2019-11-23 22:06:58,295 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 22:06:58,297 INFO L168 Benchmark]: Toolchain (without parser) took 3251.14 ms. Allocated memory was 146.3 MB in the beginning and 243.8 MB in the end (delta: 97.5 MB). Free memory was 103.0 MB in the beginning and 126.2 MB in the end (delta: -23.1 MB). Peak memory consumption was 74.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,303 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,303 INFO L168 Benchmark]: CACSL2BoogieTranslator took 281.95 ms. Allocated memory is still 146.3 MB. Free memory was 102.8 MB in the beginning and 92.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,306 INFO L168 Benchmark]: Boogie Procedure Inliner took 114.14 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 92.6 MB in the beginning and 181.1 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,306 INFO L168 Benchmark]: Boogie Preprocessor took 24.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 179.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,307 INFO L168 Benchmark]: RCFGBuilder took 370.05 ms. Allocated memory is still 202.4 MB. Free memory was 179.5 MB in the beginning and 164.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,307 INFO L168 Benchmark]: TraceAbstraction took 2456.21 ms. Allocated memory was 202.4 MB in the beginning and 243.8 MB in the end (delta: 41.4 MB). Free memory was 163.4 MB in the beginning and 126.2 MB in the end (delta: 37.2 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. [2019-11-23 22:06:58,314 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.51 ms. Allocated memory is still 146.3 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 281.95 ms. Allocated memory is still 146.3 MB. Free memory was 102.8 MB in the beginning and 92.6 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 114.14 ms. Allocated memory was 146.3 MB in the beginning and 202.4 MB in the end (delta: 56.1 MB). Free memory was 92.6 MB in the beginning and 181.1 MB in the end (delta: -88.6 MB). Peak memory consumption was 10.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 24.14 ms. Allocated memory is still 202.4 MB. Free memory was 181.1 MB in the beginning and 179.5 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 370.05 ms. Allocated memory is still 202.4 MB. Free memory was 179.5 MB in the beginning and 164.1 MB in the end (delta: 15.4 MB). Peak memory consumption was 15.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2456.21 ms. Allocated memory was 202.4 MB in the beginning and 243.8 MB in the end (delta: 41.4 MB). Free memory was 163.4 MB in the beginning and 126.2 MB in the end (delta: 37.2 MB). Peak memory consumption was 78.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 2.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...