/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/eca-rers2012/Problem01_label28.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-6598664 [2019-11-23 20:52:14,745 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-23 20:52:14,748 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-23 20:52:14,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-23 20:52:14,767 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-23 20:52:14,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-23 20:52:14,771 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-23 20:52:14,780 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-23 20:52:14,784 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-23 20:52:14,787 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-23 20:52:14,789 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-23 20:52:14,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-23 20:52:14,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-23 20:52:14,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-23 20:52:14,795 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-23 20:52:14,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-23 20:52:14,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-23 20:52:14,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-23 20:52:14,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-23 20:52:14,805 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-23 20:52:14,809 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-23 20:52:14,813 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-23 20:52:14,814 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-23 20:52:14,815 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-23 20:52:14,817 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-23 20:52:14,817 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-23 20:52:14,817 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-23 20:52:14,819 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-23 20:52:14,820 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-23 20:52:14,821 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-23 20:52:14,821 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-23 20:52:14,822 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-23 20:52:14,823 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-23 20:52:14,824 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-23 20:52:14,825 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-23 20:52:14,825 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-23 20:52:14,826 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-23 20:52:14,826 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-23 20:52:14,827 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-23 20:52:14,827 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-23 20:52:14,829 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-23 20:52:14,830 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 20:52:14,861 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-23 20:52:14,862 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-23 20:52:14,866 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-23 20:52:14,866 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-23 20:52:14,866 INFO L138 SettingsManager]: * Use SBE=true [2019-11-23 20:52:14,867 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-23 20:52:14,867 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-23 20:52:14,867 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-23 20:52:14,867 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-23 20:52:14,867 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-23 20:52:14,868 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-23 20:52:14,869 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-23 20:52:14,871 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-23 20:52:14,871 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-23 20:52:14,871 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-23 20:52:14,871 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-23 20:52:14,872 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-23 20:52:14,872 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:52:14,872 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-23 20:52:14,872 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-23 20:52:14,872 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-23 20:52:14,873 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-23 20:52:14,873 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-23 20:52:14,873 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-23 20:52:14,873 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-23 20:52:15,152 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-23 20:52:15,164 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-23 20:52:15,168 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-23 20:52:15,169 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-23 20:52:15,170 INFO L275 PluginConnector]: CDTParser initialized [2019-11-23 20:52:15,170 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem01_label28.c [2019-11-23 20:52:15,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f68b0ba/706fb220f788420eaa9658eaea9d8dc9/FLAG5c34216a5 [2019-11-23 20:52:15,752 INFO L306 CDTParser]: Found 1 translation units. [2019-11-23 20:52:15,753 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem01_label28.c [2019-11-23 20:52:15,772 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f68b0ba/706fb220f788420eaa9658eaea9d8dc9/FLAG5c34216a5 [2019-11-23 20:52:16,052 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/21f68b0ba/706fb220f788420eaa9658eaea9d8dc9 [2019-11-23 20:52:16,066 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-23 20:52:16,067 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-11-23 20:52:16,070 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:16,071 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-23 20:52:16,074 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-23 20:52:16,075 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,078 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c9ac29d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16, skipping insertion in model container [2019-11-23 20:52:16,078 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-23 20:52:16,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-23 20:52:16,705 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:16,719 INFO L203 MainTranslator]: Completed pre-run [2019-11-23 20:52:16,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-23 20:52:16,878 INFO L208 MainTranslator]: Completed translation [2019-11-23 20:52:16,879 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16 WrapperNode [2019-11-23 20:52:16,879 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-23 20:52:16,880 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:16,880 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-23 20:52:16,880 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-23 20:52:16,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,909 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-23 20:52:16,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-23 20:52:16,972 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-23 20:52:16,972 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-23 20:52:16,983 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,987 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:16,988 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:17,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:17,020 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:17,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... [2019-11-23 20:52:17,043 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-23 20:52:17,047 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-23 20:52:17,047 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-23 20:52:17,047 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-23 20:52:17,048 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-23 20:52:17,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-23 20:52:17,123 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-23 20:52:18,438 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-23 20:52:18,438 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-23 20:52:18,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:18 BoogieIcfgContainer [2019-11-23 20:52:18,440 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-23 20:52:18,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-23 20:52:18,443 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-23 20:52:18,446 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-23 20:52:18,448 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 08:52:16" (1/3) ... [2019-11-23 20:52:18,449 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20bdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:18, skipping insertion in model container [2019-11-23 20:52:18,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 08:52:16" (2/3) ... [2019-11-23 20:52:18,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f20bdef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 08:52:18, skipping insertion in model container [2019-11-23 20:52:18,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 08:52:18" (3/3) ... [2019-11-23 20:52:18,452 INFO L109 eAbstractionObserver]: Analyzing ICFG Problem01_label28.c [2019-11-23 20:52:18,462 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-23 20:52:18,470 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-23 20:52:18,481 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-23 20:52:18,511 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-23 20:52:18,512 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-23 20:52:18,512 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-23 20:52:18,512 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-23 20:52:18,512 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-23 20:52:18,513 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-23 20:52:18,513 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-23 20:52:18,513 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-23 20:52:18,535 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-11-23 20:52:18,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-23 20:52:18,546 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:18,547 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:18,547 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:18,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:18,554 INFO L82 PathProgramCache]: Analyzing trace with hash -1601987962, now seen corresponding path program 1 times [2019-11-23 20:52:18,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:18,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386206439] [2019-11-23 20:52:18,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:18,996 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 20:52:18,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386206439] [2019-11-23 20:52:18,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:18,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:19,000 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741389456] [2019-11-23 20:52:19,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:19,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:19,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:19,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:19,023 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-11-23 20:52:19,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:19,979 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-11-23 20:52:19,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:19,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-23 20:52:19,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:19,998 INFO L225 Difference]: With dead ends: 528 [2019-11-23 20:52:19,998 INFO L226 Difference]: Without dead ends: 266 [2019-11-23 20:52:20,003 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:52:20,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-11-23 20:52:20,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-11-23 20:52:20,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-11-23 20:52:20,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-11-23 20:52:20,067 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 93 [2019-11-23 20:52:20,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:20,068 INFO L462 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-11-23 20:52:20,068 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:20,068 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-11-23 20:52:20,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-11-23 20:52:20,072 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:20,073 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:20,073 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:20,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:20,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1168423854, now seen corresponding path program 1 times [2019-11-23 20:52:20,074 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:20,074 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883528217] [2019-11-23 20:52:20,074 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:20,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:20,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:20,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883528217] [2019-11-23 20:52:20,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:20,148 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:20,148 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015919347] [2019-11-23 20:52:20,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:20,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:20,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:20,152 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-11-23 20:52:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:20,763 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2019-11-23 20:52:20,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:20,763 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-11-23 20:52:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:20,767 INFO L225 Difference]: With dead ends: 792 [2019-11-23 20:52:20,768 INFO L226 Difference]: Without dead ends: 528 [2019-11-23 20:52:20,769 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:20,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-11-23 20:52:20,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-11-23 20:52:20,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-11-23 20:52:20,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions. [2019-11-23 20:52:20,817 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 98 [2019-11-23 20:52:20,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:20,818 INFO L462 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions. [2019-11-23 20:52:20,818 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:20,818 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions. [2019-11-23 20:52:20,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-23 20:52:20,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:20,828 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:20,829 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:20,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:20,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1574089224, now seen corresponding path program 1 times [2019-11-23 20:52:20,829 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:20,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741573735] [2019-11-23 20:52:20,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:20,941 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:20,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741573735] [2019-11-23 20:52:20,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:20,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:20,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357331092] [2019-11-23 20:52:20,945 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:20,946 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:20,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:20,946 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:20,947 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand 4 states. [2019-11-23 20:52:21,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:21,879 INFO L93 Difference]: Finished difference Result 2102 states and 2876 transitions. [2019-11-23 20:52:21,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:21,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 102 [2019-11-23 20:52:21,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:21,890 INFO L225 Difference]: With dead ends: 2102 [2019-11-23 20:52:21,891 INFO L226 Difference]: Without dead ends: 1576 [2019-11-23 20:52:21,892 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:21,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2019-11-23 20:52:21,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1576. [2019-11-23 20:52:21,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-11-23 20:52:21,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2045 transitions. [2019-11-23 20:52:21,933 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2045 transitions. Word has length 102 [2019-11-23 20:52:21,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:21,934 INFO L462 AbstractCegarLoop]: Abstraction has 1576 states and 2045 transitions. [2019-11-23 20:52:21,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:21,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2045 transitions. [2019-11-23 20:52:21,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-11-23 20:52:21,938 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:21,939 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:21,939 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:21,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:21,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1573040001, now seen corresponding path program 1 times [2019-11-23 20:52:21,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:21,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014681559] [2019-11-23 20:52:21,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:21,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:21,987 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-23 20:52:21,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014681559] [2019-11-23 20:52:21,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:21,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:21,989 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613341895] [2019-11-23 20:52:21,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:21,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:21,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:21,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:21,990 INFO L87 Difference]: Start difference. First operand 1576 states and 2045 transitions. Second operand 3 states. [2019-11-23 20:52:22,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:22,529 INFO L93 Difference]: Finished difference Result 3412 states and 4452 transitions. [2019-11-23 20:52:22,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:22,530 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-11-23 20:52:22,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:22,542 INFO L225 Difference]: With dead ends: 3412 [2019-11-23 20:52:22,543 INFO L226 Difference]: Without dead ends: 1838 [2019-11-23 20:52:22,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:52:22,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-11-23 20:52:22,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1314. [2019-11-23 20:52:22,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2019-11-23 20:52:22,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1699 transitions. [2019-11-23 20:52:22,584 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1699 transitions. Word has length 105 [2019-11-23 20:52:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:22,585 INFO L462 AbstractCegarLoop]: Abstraction has 1314 states and 1699 transitions. [2019-11-23 20:52:22,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1699 transitions. [2019-11-23 20:52:22,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2019-11-23 20:52:22,590 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:22,590 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:22,591 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:22,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:22,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1954141031, now seen corresponding path program 1 times [2019-11-23 20:52:22,592 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:22,592 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128425356] [2019-11-23 20:52:22,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:22,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:22,703 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128425356] [2019-11-23 20:52:22,704 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:22,704 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:22,704 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869185472] [2019-11-23 20:52:22,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:22,706 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:22,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:22,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:22,707 INFO L87 Difference]: Start difference. First operand 1314 states and 1699 transitions. Second operand 4 states. [2019-11-23 20:52:23,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:23,359 INFO L93 Difference]: Finished difference Result 2762 states and 3550 transitions. [2019-11-23 20:52:23,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:52:23,360 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 108 [2019-11-23 20:52:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:23,367 INFO L225 Difference]: With dead ends: 2762 [2019-11-23 20:52:23,368 INFO L226 Difference]: Without dead ends: 1450 [2019-11-23 20:52:23,369 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:23,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2019-11-23 20:52:23,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1445. [2019-11-23 20:52:23,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:23,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1836 transitions. [2019-11-23 20:52:23,398 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1836 transitions. Word has length 108 [2019-11-23 20:52:23,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:23,398 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1836 transitions. [2019-11-23 20:52:23,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1836 transitions. [2019-11-23 20:52:23,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-23 20:52:23,401 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:23,401 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:23,402 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:23,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:23,402 INFO L82 PathProgramCache]: Analyzing trace with hash -376310369, now seen corresponding path program 1 times [2019-11-23 20:52:23,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:23,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054139923] [2019-11-23 20:52:23,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:23,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:23,484 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:23,485 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054139923] [2019-11-23 20:52:23,485 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:23,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:23,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33021245] [2019-11-23 20:52:23,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-23 20:52:23,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:23,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-23 20:52:23,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:23,487 INFO L87 Difference]: Start difference. First operand 1445 states and 1836 transitions. Second operand 5 states. [2019-11-23 20:52:24,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:24,537 INFO L93 Difference]: Finished difference Result 2757 states and 3533 transitions. [2019-11-23 20:52:24,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-23 20:52:24,537 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 112 [2019-11-23 20:52:24,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:24,544 INFO L225 Difference]: With dead ends: 2757 [2019-11-23 20:52:24,544 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:52:24,546 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-11-23 20:52:24,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:52:24,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-23 20:52:24,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1806 transitions. [2019-11-23 20:52:24,572 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1806 transitions. Word has length 112 [2019-11-23 20:52:24,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:24,573 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1806 transitions. [2019-11-23 20:52:24,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-23 20:52:24,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1806 transitions. [2019-11-23 20:52:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-23 20:52:24,576 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:24,576 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:24,576 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:24,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:24,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1702667398, now seen corresponding path program 1 times [2019-11-23 20:52:24,577 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:24,577 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797845680] [2019-11-23 20:52:24,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:24,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:24,627 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:24,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797845680] [2019-11-23 20:52:24,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:24,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:24,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282180187] [2019-11-23 20:52:24,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:24,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:24,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:24,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:24,642 INFO L87 Difference]: Start difference. First operand 1445 states and 1806 transitions. Second operand 3 states. [2019-11-23 20:52:25,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:25,189 INFO L93 Difference]: Finished difference Result 3150 states and 3956 transitions. [2019-11-23 20:52:25,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:25,190 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-23 20:52:25,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:25,198 INFO L225 Difference]: With dead ends: 3150 [2019-11-23 20:52:25,198 INFO L226 Difference]: Without dead ends: 1707 [2019-11-23 20:52:25,202 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 20:52:25,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-11-23 20:52:25,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-11-23 20:52:25,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:25,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1665 transitions. [2019-11-23 20:52:25,242 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1665 transitions. Word has length 115 [2019-11-23 20:52:25,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:25,243 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1665 transitions. [2019-11-23 20:52:25,244 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:25,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1665 transitions. [2019-11-23 20:52:25,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-11-23 20:52:25,247 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:25,247 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:25,247 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:25,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:25,248 INFO L82 PathProgramCache]: Analyzing trace with hash 970685544, now seen corresponding path program 1 times [2019-11-23 20:52:25,249 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:25,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549282992] [2019-11-23 20:52:25,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:25,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:25,311 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-23 20:52:25,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549282992] [2019-11-23 20:52:25,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:25,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-23 20:52:25,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518001465] [2019-11-23 20:52:25,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:25,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:25,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:25,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:25,313 INFO L87 Difference]: Start difference. First operand 1445 states and 1665 transitions. Second operand 3 states. [2019-11-23 20:52:25,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:25,774 INFO L93 Difference]: Finished difference Result 2888 states and 3326 transitions. [2019-11-23 20:52:25,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:25,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 123 [2019-11-23 20:52:25,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:25,781 INFO L225 Difference]: With dead ends: 2888 [2019-11-23 20:52:25,781 INFO L226 Difference]: Without dead ends: 1445 [2019-11-23 20:52:25,783 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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 20:52:25,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-11-23 20:52:25,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-11-23 20:52:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-11-23 20:52:25,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1593 transitions. [2019-11-23 20:52:25,818 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1593 transitions. Word has length 123 [2019-11-23 20:52:25,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:25,819 INFO L462 AbstractCegarLoop]: Abstraction has 1445 states and 1593 transitions. [2019-11-23 20:52:25,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:25,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1593 transitions. [2019-11-23 20:52:25,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-11-23 20:52:25,823 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:25,823 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:25,823 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:25,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:25,824 INFO L82 PathProgramCache]: Analyzing trace with hash 2027458046, now seen corresponding path program 1 times [2019-11-23 20:52:25,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:25,825 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614928217] [2019-11-23 20:52:25,825 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:25,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:26,560 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-23 20:52:26,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614928217] [2019-11-23 20:52:26,560 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:26,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-11-23 20:52:26,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742314450] [2019-11-23 20:52:26,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-23 20:52:26,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:26,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-23 20:52:26,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=77, Unknown=0, NotChecked=0, Total=132 [2019-11-23 20:52:26,562 INFO L87 Difference]: Start difference. First operand 1445 states and 1593 transitions. Second operand 12 states. [2019-11-23 20:52:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:28,185 INFO L93 Difference]: Finished difference Result 3260 states and 3653 transitions. [2019-11-23 20:52:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-23 20:52:28,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 130 [2019-11-23 20:52:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:28,194 INFO L225 Difference]: With dead ends: 3260 [2019-11-23 20:52:28,195 INFO L226 Difference]: Without dead ends: 1914 [2019-11-23 20:52:28,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=115, Invalid=157, Unknown=0, NotChecked=0, Total=272 [2019-11-23 20:52:28,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2019-11-23 20:52:28,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1742. [2019-11-23 20:52:28,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-23 20:52:28,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1908 transitions. [2019-11-23 20:52:28,269 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1908 transitions. Word has length 130 [2019-11-23 20:52:28,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:28,269 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1908 transitions. [2019-11-23 20:52:28,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-23 20:52:28,269 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1908 transitions. [2019-11-23 20:52:28,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2019-11-23 20:52:28,274 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:28,274 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:28,274 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:28,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:28,275 INFO L82 PathProgramCache]: Analyzing trace with hash 591091391, now seen corresponding path program 1 times [2019-11-23 20:52:28,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:28,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793331606] [2019-11-23 20:52:28,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:28,440 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 171 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-11-23 20:52:28,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793331606] [2019-11-23 20:52:28,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:28,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-23 20:52:28,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29026216] [2019-11-23 20:52:28,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-23 20:52:28,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:28,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-23 20:52:28,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:28,442 INFO L87 Difference]: Start difference. First operand 1742 states and 1908 transitions. Second operand 4 states. [2019-11-23 20:52:29,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:29,214 INFO L93 Difference]: Finished difference Result 3613 states and 3988 transitions. [2019-11-23 20:52:29,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-23 20:52:29,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 200 [2019-11-23 20:52:29,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:29,222 INFO L225 Difference]: With dead ends: 3613 [2019-11-23 20:52:29,222 INFO L226 Difference]: Without dead ends: 1873 [2019-11-23 20:52:29,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-23 20:52:29,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2019-11-23 20:52:29,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1742. [2019-11-23 20:52:29,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-23 20:52:29,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1878 transitions. [2019-11-23 20:52:29,256 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1878 transitions. Word has length 200 [2019-11-23 20:52:29,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:29,257 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1878 transitions. [2019-11-23 20:52:29,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-23 20:52:29,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1878 transitions. [2019-11-23 20:52:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-11-23 20:52:29,261 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:29,261 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:29,262 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:29,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:29,262 INFO L82 PathProgramCache]: Analyzing trace with hash 490719990, now seen corresponding path program 1 times [2019-11-23 20:52:29,262 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:29,262 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912350421] [2019-11-23 20:52:29,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-11-23 20:52:29,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912350421] [2019-11-23 20:52:29,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-23 20:52:29,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-23 20:52:29,442 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777998441] [2019-11-23 20:52:29,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:29,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:29,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:29,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-23 20:52:29,443 INFO L87 Difference]: Start difference. First operand 1742 states and 1878 transitions. Second operand 3 states. [2019-11-23 20:52:29,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:29,827 INFO L93 Difference]: Finished difference Result 1744 states and 1879 transitions. [2019-11-23 20:52:29,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:29,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 208 [2019-11-23 20:52:29,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:29,837 INFO L225 Difference]: With dead ends: 1744 [2019-11-23 20:52:29,837 INFO L226 Difference]: Without dead ends: 1742 [2019-11-23 20:52:29,838 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 20:52:29,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1742 states. [2019-11-23 20:52:29,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1742 to 1742. [2019-11-23 20:52:29,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1742 states. [2019-11-23 20:52:29,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1742 states to 1742 states and 1877 transitions. [2019-11-23 20:52:29,878 INFO L78 Accepts]: Start accepts. Automaton has 1742 states and 1877 transitions. Word has length 208 [2019-11-23 20:52:29,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:29,879 INFO L462 AbstractCegarLoop]: Abstraction has 1742 states and 1877 transitions. [2019-11-23 20:52:29,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:29,879 INFO L276 IsEmpty]: Start isEmpty. Operand 1742 states and 1877 transitions. [2019-11-23 20:52:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2019-11-23 20:52:29,885 INFO L402 BasicCegarLoop]: Found error trace [2019-11-23 20:52:29,885 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-23 20:52:29,885 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-23 20:52:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-23 20:52:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1524272564, now seen corresponding path program 1 times [2019-11-23 20:52:29,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-23 20:52:29,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885557198] [2019-11-23 20:52:29,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-23 20:52:29,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:30,887 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 351 proven. 8 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2019-11-23 20:52:30,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885557198] [2019-11-23 20:52:30,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814322986] [2019-11-23 20:52:30,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-23 20:52:31,012 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-23 20:52:31,027 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-23 20:52:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 467 backedges. 291 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2019-11-23 20:52:31,205 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-23 20:52:31,205 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-11-23 20:52:31,205 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168169079] [2019-11-23 20:52:31,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-23 20:52:31,206 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-23 20:52:31,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-23 20:52:31,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:52:31,206 INFO L87 Difference]: Start difference. First operand 1742 states and 1877 transitions. Second operand 3 states. [2019-11-23 20:52:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-23 20:52:31,605 INFO L93 Difference]: Finished difference Result 1742 states and 1877 transitions. [2019-11-23 20:52:31,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-23 20:52:31,605 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 283 [2019-11-23 20:52:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-23 20:52:31,606 INFO L225 Difference]: With dead ends: 1742 [2019-11-23 20:52:31,607 INFO L226 Difference]: Without dead ends: 0 [2019-11-23 20:52:31,609 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 287 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-11-23 20:52:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-23 20:52:31,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-23 20:52:31,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-23 20:52:31,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-23 20:52:31,610 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 283 [2019-11-23 20:52:31,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-23 20:52:31,611 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-23 20:52:31,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-23 20:52:31,611 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-23 20:52:31,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-23 20:52:31,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-23 20:52:31,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-23 20:52:32,024 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-23 20:52:32,147 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-23 20:52:32,150 INFO L444 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-11-23 20:52:32,150 INFO L444 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-11-23 20:52:32,150 INFO L444 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,150 INFO L444 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-11-23 20:52:32,151 INFO L444 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-11-23 20:52:32,152 INFO L444 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-11-23 20:52:32,152 INFO L444 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-11-23 20:52:32,152 INFO L444 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,153 INFO L444 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,154 INFO L444 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,154 INFO L444 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,154 INFO L444 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-11-23 20:52:32,154 INFO L444 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-11-23 20:52:32,155 INFO L444 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-11-23 20:52:32,156 INFO L444 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,157 INFO L444 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,158 INFO L444 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,159 INFO L444 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-11-23 20:52:32,159 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-11-23 20:52:32,159 INFO L444 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-11-23 20:52:32,160 INFO L444 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-11-23 20:52:32,160 INFO L444 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-11-23 20:52:32,160 INFO L444 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-11-23 20:52:32,161 INFO L444 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-11-23 20:52:32,161 INFO L444 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-11-23 20:52:32,161 INFO L444 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-11-23 20:52:32,164 INFO L440 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-11-23 20:52:32,165 INFO L444 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-11-23 20:52:32,166 INFO L444 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L447 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-11-23 20:52:32,167 INFO L444 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,168 INFO L444 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-11-23 20:52:32,169 INFO L444 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-11-23 20:52:32,170 INFO L444 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L440 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse0 (= 1 ~a7~0))) (let ((.cse1 (<= ~a21~0 0)) (.cse2 (not (= ~a16~0 6))) (.cse3 (= ~a17~0 1)) (.cse5 (= ~a16~0 4)) (.cse6 (not .cse0)) (.cse4 (= ~a21~0 1))) (or (and .cse0 .cse1 .cse2) (and .cse0 .cse1 (= ~a12~0 8) (= ~a20~0 1)) (and .cse2 .cse3 .cse4) (and .cse5 (<= ~a17~0 0) .cse4) (and .cse4 (= ~a16~0 5)) (and .cse6 .cse4 (= 15 ~a8~0)) (and .cse6 .cse3 .cse4) (and .cse5 .cse6 .cse4)))) [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-11-23 20:52:32,171 INFO L444 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,172 INFO L444 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-11-23 20:52:32,173 INFO L444 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-11-23 20:52:32,174 INFO L444 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-11-23 20:52:32,175 INFO L444 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,176 INFO L444 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-11-23 20:52:32,177 INFO L444 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 455) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-11-23 20:52:32,178 INFO L444 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-11-23 20:52:32,179 INFO L444 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-11-23 20:52:32,180 INFO L444 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-11-23 20:52:32,180 INFO L444 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-11-23 20:52:32,180 INFO L444 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-11-23 20:52:32,180 INFO L444 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-11-23 20:52:32,180 INFO L444 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-11-23 20:52:32,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 08:52:32 BoogieIcfgContainer [2019-11-23 20:52:32,209 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-23 20:52:32,211 INFO L168 Benchmark]: Toolchain (without parser) took 16143.66 ms. Allocated memory was 146.3 MB in the beginning and 461.9 MB in the end (delta: 315.6 MB). Free memory was 100.9 MB in the beginning and 271.5 MB in the end (delta: -170.5 MB). Peak memory consumption was 145.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,212 INFO L168 Benchmark]: CDTParser took 0.23 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,213 INFO L168 Benchmark]: CACSL2BoogieTranslator took 808.85 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.7 MB in the beginning and 167.3 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,214 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.21 ms. Allocated memory is still 205.0 MB. Free memory was 167.3 MB in the beginning and 161.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,214 INFO L168 Benchmark]: Boogie Preprocessor took 71.46 ms. Allocated memory is still 205.0 MB. Free memory was 161.3 MB in the beginning and 156.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,215 INFO L168 Benchmark]: RCFGBuilder took 1393.22 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 156.6 MB in the beginning and 168.6 MB in the end (delta: -12.0 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,216 INFO L168 Benchmark]: TraceAbstraction took 13767.22 ms. Allocated memory was 239.1 MB in the beginning and 461.9 MB in the end (delta: 222.8 MB). Free memory was 167.1 MB in the beginning and 271.5 MB in the end (delta: -104.3 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. [2019-11-23 20:52:32,220 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.23 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: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 808.85 ms. Allocated memory was 146.3 MB in the beginning and 205.0 MB in the end (delta: 58.7 MB). Free memory was 100.7 MB in the beginning and 167.3 MB in the end (delta: -66.6 MB). Peak memory consumption was 27.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 92.21 ms. Allocated memory is still 205.0 MB. Free memory was 167.3 MB in the beginning and 161.3 MB in the end (delta: 6.0 MB). Peak memory consumption was 6.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 71.46 ms. Allocated memory is still 205.0 MB. Free memory was 161.3 MB in the beginning and 156.6 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1393.22 ms. Allocated memory was 205.0 MB in the beginning and 239.1 MB in the end (delta: 34.1 MB). Free memory was 156.6 MB in the beginning and 168.6 MB in the end (delta: -12.0 MB). Peak memory consumption was 73.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13767.22 ms. Allocated memory was 239.1 MB in the beginning and 461.9 MB in the end (delta: 222.8 MB). Free memory was 167.1 MB in the beginning and 271.5 MB in the end (delta: -104.3 MB). Peak memory consumption was 118.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 455]: 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: 30]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((1 == a7 && a21 <= 0) && !(a16 == 6)) || (((1 == a7 && a21 <= 0) && a12 == 8) && a20 == 1)) || ((!(a16 == 6) && a17 == 1) && a21 == 1)) || ((a16 == 4 && a17 <= 0) && a21 == 1)) || (a21 == 1 && a16 == 5)) || ((!(1 == a7) && a21 == 1) && 15 == a8)) || ((!(1 == a7) && a17 == 1) && a21 == 1)) || ((a16 == 4 && !(1 == a7)) && a21 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. Result: SAFE, OverallTime: 13.6s, OverallIterations: 12, TraceHistogramMax: 7, AutomataDifference: 9.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 887 SDtfs, 2590 SDslu, 128 SDs, 0 SdLazy, 5907 SolverSat, 779 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 357 GetRequests, 306 SyntacticMatches, 7 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1742occurred in iteration=9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1094 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 173 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 3 FomulaSimplificationsInter, 120 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 1960 NumberOfCodeBlocks, 1960 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 1947 ConstructedInterpolants, 0 QuantifiedInterpolants, 1696138 SizeOfPredicates, 1 NumberOfNonLiveVariables, 514 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1511/1519 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...