java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-df4b876 [2018-11-06 21:02:45,997 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-06 21:02:45,999 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-06 21:02:46,015 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-06 21:02:46,016 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-06 21:02:46,017 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-06 21:02:46,018 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-06 21:02:46,022 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-06 21:02:46,023 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-06 21:02:46,025 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-06 21:02:46,026 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-06 21:02:46,026 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-06 21:02:46,028 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-06 21:02:46,029 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-06 21:02:46,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-06 21:02:46,031 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-06 21:02:46,032 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-06 21:02:46,034 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-06 21:02:46,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-06 21:02:46,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-06 21:02:46,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-06 21:02:46,040 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-06 21:02:46,042 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-06 21:02:46,042 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-06 21:02:46,043 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-06 21:02:46,043 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-06 21:02:46,044 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-06 21:02:46,045 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-06 21:02:46,046 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-06 21:02:46,047 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-06 21:02:46,048 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-06 21:02:46,048 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-06 21:02:46,048 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-06 21:02:46,049 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-06 21:02:46,050 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-06 21:02:46,050 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-06 21:02:46,051 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-64bit-Automizer_Default.epf [2018-11-06 21:02:46,069 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-06 21:02:46,070 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-06 21:02:46,073 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-06 21:02:46,073 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-06 21:02:46,074 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-06 21:02:46,074 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-06 21:02:46,074 INFO L133 SettingsManager]: * Use SBE=true [2018-11-06 21:02:46,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-06 21:02:46,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-06 21:02:46,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-06 21:02:46,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-06 21:02:46,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-06 21:02:46,075 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-06 21:02:46,076 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-06 21:02:46,076 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-06 21:02:46,076 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-06 21:02:46,076 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-06 21:02:46,076 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-06 21:02:46,077 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-06 21:02:46,077 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-06 21:02:46,077 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-06 21:02:46,077 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-06 21:02:46,077 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-06 21:02:46,078 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-06 21:02:46,078 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-06 21:02:46,078 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-06 21:02:46,078 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-06 21:02:46,078 INFO L133 SettingsManager]: * To the following directory=dump/ [2018-11-06 21:02:46,132 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-06 21:02:46,149 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-06 21:02:46,153 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-06 21:02:46,155 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-06 21:02:46,156 INFO L276 PluginConnector]: CDTParser initialized [2018-11-06 21:02:46,156 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-11-06 21:02:46,229 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61913f3dc/e8be1166867b4745927ba90f3b103207/FLAGc07554fd4 [2018-11-06 21:02:46,870 INFO L298 CDTParser]: Found 1 translation units. [2018-11-06 21:02:46,871 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/eca-rers2012/Problem11_label19_true-unreach-call.c [2018-11-06 21:02:46,887 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61913f3dc/e8be1166867b4745927ba90f3b103207/FLAGc07554fd4 [2018-11-06 21:02:46,909 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61913f3dc/e8be1166867b4745927ba90f3b103207 [2018-11-06 21:02:46,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-06 21:02:46,922 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-11-06 21:02:46,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:46,923 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-06 21:02:46,927 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-06 21:02:46,928 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:46" (1/1) ... [2018-11-06 21:02:46,931 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@513c6e8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:46, skipping insertion in model container [2018-11-06 21:02:46,932 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:02:46" (1/1) ... [2018-11-06 21:02:46,942 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-06 21:02:47,020 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-06 21:02:47,603 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:47,610 INFO L189 MainTranslator]: Completed pre-run [2018-11-06 21:02:47,814 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-06 21:02:47,833 INFO L193 MainTranslator]: Completed translation [2018-11-06 21:02:47,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47 WrapperNode [2018-11-06 21:02:47,834 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-06 21:02:47,835 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:47,835 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-06 21:02:47,835 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-06 21:02:47,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,007 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,130 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-06 21:02:48,131 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-06 21:02:48,131 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-06 21:02:48,131 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-06 21:02:48,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,156 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,157 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,216 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,237 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,265 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (1/1) ... [2018-11-06 21:02:48,283 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-06 21:02:48,284 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-06 21:02:48,284 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-06 21:02:48,284 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-06 21:02:48,285 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (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 [2018-11-06 21:02:48,357 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-06 21:02:48,358 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-06 21:02:48,358 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-06 21:02:53,172 INFO L276 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-06 21:02:53,173 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:53 BoogieIcfgContainer [2018-11-06 21:02:53,173 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-06 21:02:53,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-06 21:02:53,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-06 21:02:53,178 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-06 21:02:53,179 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:02:46" (1/3) ... [2018-11-06 21:02:53,179 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f11631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:53, skipping insertion in model container [2018-11-06 21:02:53,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:02:47" (2/3) ... [2018-11-06 21:02:53,180 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f11631 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:02:53, skipping insertion in model container [2018-11-06 21:02:53,180 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:02:53" (3/3) ... [2018-11-06 21:02:53,182 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label19_true-unreach-call.c [2018-11-06 21:02:53,193 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-06 21:02:53,202 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-06 21:02:53,220 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-06 21:02:53,257 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-06 21:02:53,258 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-06 21:02:53,258 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-06 21:02:53,259 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-06 21:02:53,259 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-06 21:02:53,259 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-06 21:02:53,260 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-06 21:02:53,260 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-06 21:02:53,260 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-06 21:02:53,286 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states. [2018-11-06 21:02:53,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-06 21:02:53,296 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:53,298 INFO L375 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] [2018-11-06 21:02:53,300 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:53,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1848943538, now seen corresponding path program 1 times [2018-11-06 21:02:53,309 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:53,310 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:53,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:53,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:53,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:53,823 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:02:53,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:53,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:53,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:53,923 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:53,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:53,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:53,942 INFO L87 Difference]: Start difference. First operand 284 states. Second operand 4 states. [2018-11-06 21:02:57,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:02:57,087 INFO L93 Difference]: Finished difference Result 964 states and 1743 transitions. [2018-11-06 21:02:57,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:02:57,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2018-11-06 21:02:57,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:02:57,114 INFO L225 Difference]: With dead ends: 964 [2018-11-06 21:02:57,114 INFO L226 Difference]: Without dead ends: 673 [2018-11-06 21:02:57,120 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:57,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2018-11-06 21:02:57,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 658. [2018-11-06 21:02:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 658 states. [2018-11-06 21:02:57,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 658 states to 658 states and 1087 transitions. [2018-11-06 21:02:57,209 INFO L78 Accepts]: Start accepts. Automaton has 658 states and 1087 transitions. Word has length 57 [2018-11-06 21:02:57,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:02:57,210 INFO L480 AbstractCegarLoop]: Abstraction has 658 states and 1087 transitions. [2018-11-06 21:02:57,210 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:02:57,210 INFO L276 IsEmpty]: Start isEmpty. Operand 658 states and 1087 transitions. [2018-11-06 21:02:57,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-11-06 21:02:57,218 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:02:57,219 INFO L375 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, 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] [2018-11-06 21:02:57,219 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:02:57,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:02:57,220 INFO L82 PathProgramCache]: Analyzing trace with hash -333980735, now seen corresponding path program 1 times [2018-11-06 21:02:57,220 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:02:57,220 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:02:57,221 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:57,222 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:02:57,222 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:02:57,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:02:57,541 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:02:57,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:02:57,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:02:57,544 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:02:57,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:02:57,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:02:57,545 INFO L87 Difference]: Start difference. First operand 658 states and 1087 transitions. Second operand 4 states. [2018-11-06 21:03:01,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:01,946 INFO L93 Difference]: Finished difference Result 2453 states and 4148 transitions. [2018-11-06 21:03:01,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:01,946 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-11-06 21:03:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:01,957 INFO L225 Difference]: With dead ends: 2453 [2018-11-06 21:03:01,957 INFO L226 Difference]: Without dead ends: 1797 [2018-11-06 21:03:01,962 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:01,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1797 states. [2018-11-06 21:03:02,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1797 to 1214. [2018-11-06 21:03:02,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1214 states. [2018-11-06 21:03:02,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1787 transitions. [2018-11-06 21:03:02,015 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1787 transitions. Word has length 131 [2018-11-06 21:03:02,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:02,016 INFO L480 AbstractCegarLoop]: Abstraction has 1214 states and 1787 transitions. [2018-11-06 21:03:02,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:02,016 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1787 transitions. [2018-11-06 21:03:02,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-11-06 21:03:02,020 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:02,021 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:02,021 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:02,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:02,021 INFO L82 PathProgramCache]: Analyzing trace with hash -58515139, now seen corresponding path program 1 times [2018-11-06 21:03:02,021 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:02,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:02,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:02,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:02,207 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:02,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:03:02,208 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:02,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:02,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:02,209 INFO L87 Difference]: Start difference. First operand 1214 states and 1787 transitions. Second operand 3 states. [2018-11-06 21:03:04,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:04,276 INFO L93 Difference]: Finished difference Result 3538 states and 5244 transitions. [2018-11-06 21:03:04,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:04,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 175 [2018-11-06 21:03:04,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:04,290 INFO L225 Difference]: With dead ends: 3538 [2018-11-06 21:03:04,290 INFO L226 Difference]: Without dead ends: 2326 [2018-11-06 21:03:04,293 INFO L604 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 [2018-11-06 21:03:04,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2018-11-06 21:03:04,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2326. [2018-11-06 21:03:04,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2326 states. [2018-11-06 21:03:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2326 states to 2326 states and 3212 transitions. [2018-11-06 21:03:04,345 INFO L78 Accepts]: Start accepts. Automaton has 2326 states and 3212 transitions. Word has length 175 [2018-11-06 21:03:04,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:04,348 INFO L480 AbstractCegarLoop]: Abstraction has 2326 states and 3212 transitions. [2018-11-06 21:03:04,348 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:04,349 INFO L276 IsEmpty]: Start isEmpty. Operand 2326 states and 3212 transitions. [2018-11-06 21:03:04,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-11-06 21:03:04,353 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:04,354 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:04,354 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:04,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:04,354 INFO L82 PathProgramCache]: Analyzing trace with hash 366212986, now seen corresponding path program 1 times [2018-11-06 21:03:04,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:04,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:04,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:04,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:04,742 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2018-11-06 21:03:04,742 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:04,742 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:04,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:04,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:04,932 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2018-11-06 21:03:04,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:04,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 3 [2018-11-06 21:03:04,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:04,968 INFO L87 Difference]: Start difference. First operand 2326 states and 3212 transitions. Second operand 4 states. [2018-11-06 21:03:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:07,973 INFO L93 Difference]: Finished difference Result 6878 states and 9280 transitions. [2018-11-06 21:03:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:07,974 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 201 [2018-11-06 21:03:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:07,998 INFO L225 Difference]: With dead ends: 6878 [2018-11-06 21:03:07,998 INFO L226 Difference]: Without dead ends: 4554 [2018-11-06 21:03:08,003 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 201 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:08,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4554 states. [2018-11-06 21:03:08,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4554 to 4553. [2018-11-06 21:03:08,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4553 states. [2018-11-06 21:03:08,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4553 states to 4553 states and 5818 transitions. [2018-11-06 21:03:08,166 INFO L78 Accepts]: Start accepts. Automaton has 4553 states and 5818 transitions. Word has length 201 [2018-11-06 21:03:08,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:08,168 INFO L480 AbstractCegarLoop]: Abstraction has 4553 states and 5818 transitions. [2018-11-06 21:03:08,168 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:08,168 INFO L276 IsEmpty]: Start isEmpty. Operand 4553 states and 5818 transitions. [2018-11-06 21:03:08,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-11-06 21:03:08,174 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:08,174 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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] [2018-11-06 21:03:08,175 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:08,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:08,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1905852891, now seen corresponding path program 1 times [2018-11-06 21:03:08,176 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:08,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:08,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:08,177 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:08,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:08,774 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 9 [2018-11-06 21:03:09,040 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 109 proven. 69 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:09,041 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:09,041 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:09,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:09,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:09,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:09,658 WARN L179 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2018-11-06 21:03:10,252 WARN L179 SmtUtils]: Spent 405.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 26 [2018-11-06 21:03:12,986 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 82 proven. 96 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:13,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:13,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 10 [2018-11-06 21:03:13,008 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:03:13,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:03:13,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:03:13,010 INFO L87 Difference]: Start difference. First operand 4553 states and 5818 transitions. Second operand 11 states. [2018-11-06 21:03:15,256 WARN L179 SmtUtils]: Spent 399.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2018-11-06 21:03:16,012 WARN L179 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 20 [2018-11-06 21:03:33,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:33,066 INFO L93 Difference]: Finished difference Result 27649 states and 35222 transitions. [2018-11-06 21:03:33,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-11-06 21:03:33,067 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-11-06 21:03:33,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:33,152 INFO L225 Difference]: With dead ends: 27649 [2018-11-06 21:03:33,152 INFO L226 Difference]: Without dead ends: 23283 [2018-11-06 21:03:33,163 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 189 SyntacticMatches, 47 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=260, Invalid=862, Unknown=0, NotChecked=0, Total=1122 [2018-11-06 21:03:33,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23283 states. [2018-11-06 21:03:33,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23283 to 15495. [2018-11-06 21:03:33,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15495 states. [2018-11-06 21:03:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15495 states to 15495 states and 18406 transitions. [2018-11-06 21:03:33,478 INFO L78 Accepts]: Start accepts. Automaton has 15495 states and 18406 transitions. Word has length 240 [2018-11-06 21:03:33,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:33,478 INFO L480 AbstractCegarLoop]: Abstraction has 15495 states and 18406 transitions. [2018-11-06 21:03:33,478 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:03:33,479 INFO L276 IsEmpty]: Start isEmpty. Operand 15495 states and 18406 transitions. [2018-11-06 21:03:33,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-11-06 21:03:33,490 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:33,491 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:33,491 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:33,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1951416041, now seen corresponding path program 1 times [2018-11-06 21:03:33,492 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:33,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:33,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:33,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:33,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:33,960 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:33,961 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:33,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:33,961 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:03:33,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:03:33,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:33,962 INFO L87 Difference]: Start difference. First operand 15495 states and 18406 transitions. Second operand 5 states. [2018-11-06 21:03:38,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:38,195 INFO L93 Difference]: Finished difference Result 43252 states and 52192 transitions. [2018-11-06 21:03:38,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:03:38,198 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 251 [2018-11-06 21:03:38,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:38,257 INFO L225 Difference]: With dead ends: 43252 [2018-11-06 21:03:38,257 INFO L226 Difference]: Without dead ends: 27944 [2018-11-06 21:03:38,277 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:38,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27944 states. [2018-11-06 21:03:38,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27944 to 22729. [2018-11-06 21:03:38,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22729 states. [2018-11-06 21:03:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22729 states to 22729 states and 26487 transitions. [2018-11-06 21:03:38,624 INFO L78 Accepts]: Start accepts. Automaton has 22729 states and 26487 transitions. Word has length 251 [2018-11-06 21:03:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:38,625 INFO L480 AbstractCegarLoop]: Abstraction has 22729 states and 26487 transitions. [2018-11-06 21:03:38,625 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 22729 states and 26487 transitions. [2018-11-06 21:03:38,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-11-06 21:03:38,659 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:38,659 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:03:38,660 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:38,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:38,660 INFO L82 PathProgramCache]: Analyzing trace with hash 959638500, now seen corresponding path program 1 times [2018-11-06 21:03:38,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:38,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:38,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:38,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:38,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:39,033 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-11-06 21:03:39,123 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2018-11-06 21:03:39,123 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:39,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:03:39,124 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:39,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:39,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:39,125 INFO L87 Difference]: Start difference. First operand 22729 states and 26487 transitions. Second operand 4 states. [2018-11-06 21:03:41,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:41,474 INFO L93 Difference]: Finished difference Result 48245 states and 56730 transitions. [2018-11-06 21:03:41,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:03:41,474 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 330 [2018-11-06 21:03:41,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:41,519 INFO L225 Difference]: With dead ends: 48245 [2018-11-06 21:03:41,519 INFO L226 Difference]: Without dead ends: 25703 [2018-11-06 21:03:41,545 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25703 states. [2018-11-06 21:03:41,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25703 to 25319. [2018-11-06 21:03:41,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25319 states. [2018-11-06 21:03:41,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25319 states to 25319 states and 29406 transitions. [2018-11-06 21:03:41,855 INFO L78 Accepts]: Start accepts. Automaton has 25319 states and 29406 transitions. Word has length 330 [2018-11-06 21:03:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:41,856 INFO L480 AbstractCegarLoop]: Abstraction has 25319 states and 29406 transitions. [2018-11-06 21:03:41,856 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 25319 states and 29406 transitions. [2018-11-06 21:03:42,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-11-06 21:03:42,034 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:42,034 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 4, 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, 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] [2018-11-06 21:03:42,034 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:42,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:42,035 INFO L82 PathProgramCache]: Analyzing trace with hash -92001179, now seen corresponding path program 1 times [2018-11-06 21:03:42,035 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:42,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:42,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:42,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:42,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:42,489 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2018-11-06 21:03:42,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:42,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-06 21:03:42,490 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:03:42,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:03:42,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:42,491 INFO L87 Difference]: Start difference. First operand 25319 states and 29406 transitions. Second operand 5 states. [2018-11-06 21:03:44,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:44,394 INFO L93 Difference]: Finished difference Result 51773 states and 60301 transitions. [2018-11-06 21:03:44,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:03:44,395 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 333 [2018-11-06 21:03:44,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:44,423 INFO L225 Difference]: With dead ends: 51773 [2018-11-06 21:03:44,423 INFO L226 Difference]: Without dead ends: 26641 [2018-11-06 21:03:44,448 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:44,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26641 states. [2018-11-06 21:03:44,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26641 to 25880. [2018-11-06 21:03:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25880 states. [2018-11-06 21:03:44,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25880 states to 25880 states and 29638 transitions. [2018-11-06 21:03:44,753 INFO L78 Accepts]: Start accepts. Automaton has 25880 states and 29638 transitions. Word has length 333 [2018-11-06 21:03:44,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:44,754 INFO L480 AbstractCegarLoop]: Abstraction has 25880 states and 29638 transitions. [2018-11-06 21:03:44,754 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:44,755 INFO L276 IsEmpty]: Start isEmpty. Operand 25880 states and 29638 transitions. [2018-11-06 21:03:44,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-11-06 21:03:44,775 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:44,775 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2018-11-06 21:03:44,775 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:44,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:44,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1057714593, now seen corresponding path program 1 times [2018-11-06 21:03:44,776 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:44,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:44,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:44,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:45,103 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2018-11-06 21:03:45,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:45,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-06 21:03:45,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:45,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:45,105 INFO L87 Difference]: Start difference. First operand 25880 states and 29638 transitions. Second operand 3 states. [2018-11-06 21:03:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:46,049 INFO L93 Difference]: Finished difference Result 51011 states and 58274 transitions. [2018-11-06 21:03:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:46,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 341 [2018-11-06 21:03:46,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:46,070 INFO L225 Difference]: With dead ends: 51011 [2018-11-06 21:03:46,071 INFO L226 Difference]: Without dead ends: 25318 [2018-11-06 21:03:46,085 INFO L604 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 [2018-11-06 21:03:46,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25318 states. [2018-11-06 21:03:46,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25318 to 25316. [2018-11-06 21:03:46,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25316 states. [2018-11-06 21:03:46,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25316 states to 25316 states and 28819 transitions. [2018-11-06 21:03:46,349 INFO L78 Accepts]: Start accepts. Automaton has 25316 states and 28819 transitions. Word has length 341 [2018-11-06 21:03:46,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:46,350 INFO L480 AbstractCegarLoop]: Abstraction has 25316 states and 28819 transitions. [2018-11-06 21:03:46,350 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:46,350 INFO L276 IsEmpty]: Start isEmpty. Operand 25316 states and 28819 transitions. [2018-11-06 21:03:46,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-11-06 21:03:46,378 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:46,379 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2018-11-06 21:03:46,379 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:46,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:46,379 INFO L82 PathProgramCache]: Analyzing trace with hash 760978084, now seen corresponding path program 1 times [2018-11-06 21:03:46,380 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:46,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:46,380 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:46,381 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:46,381 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:46,897 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 287 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2018-11-06 21:03:46,898 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:03:46,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-06 21:03:46,898 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-06 21:03:46,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-06 21:03:46,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-06 21:03:46,899 INFO L87 Difference]: Start difference. First operand 25316 states and 28819 transitions. Second operand 3 states. [2018-11-06 21:03:48,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:48,205 INFO L93 Difference]: Finished difference Result 52855 states and 60348 transitions. [2018-11-06 21:03:48,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:48,206 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 364 [2018-11-06 21:03:48,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:48,233 INFO L225 Difference]: With dead ends: 52855 [2018-11-06 21:03:48,234 INFO L226 Difference]: Without dead ends: 26239 [2018-11-06 21:03:48,251 INFO L604 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 [2018-11-06 21:03:48,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26239 states. [2018-11-06 21:03:48,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26239 to 25296. [2018-11-06 21:03:48,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25296 states. [2018-11-06 21:03:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25296 states to 25296 states and 28389 transitions. [2018-11-06 21:03:48,545 INFO L78 Accepts]: Start accepts. Automaton has 25296 states and 28389 transitions. Word has length 364 [2018-11-06 21:03:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:48,546 INFO L480 AbstractCegarLoop]: Abstraction has 25296 states and 28389 transitions. [2018-11-06 21:03:48,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-06 21:03:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25296 states and 28389 transitions. [2018-11-06 21:03:48,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-11-06 21:03:48,565 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:48,566 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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] [2018-11-06 21:03:48,566 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:48,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:48,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1344011755, now seen corresponding path program 1 times [2018-11-06 21:03:48,567 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:48,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:48,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:48,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:48,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 136 proven. 310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-06 21:03:49,404 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:49,404 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:49,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:49,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:49,532 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:49,640 INFO L134 CoverageAnalysis]: Checked inductivity of 446 backedges. 164 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-06 21:03:49,660 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:49,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2018-11-06 21:03:49,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-06 21:03:49,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-06 21:03:49,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:03:49,662 INFO L87 Difference]: Start difference. First operand 25296 states and 28389 transitions. Second operand 6 states. [2018-11-06 21:03:53,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:53,087 INFO L93 Difference]: Finished difference Result 50232 states and 56360 transitions. [2018-11-06 21:03:53,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:03:53,088 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 381 [2018-11-06 21:03:53,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:53,111 INFO L225 Difference]: With dead ends: 50232 [2018-11-06 21:03:53,111 INFO L226 Difference]: Without dead ends: 25123 [2018-11-06 21:03:53,126 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 380 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-06 21:03:53,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25123 states. [2018-11-06 21:03:53,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25123 to 20089. [2018-11-06 21:03:53,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20089 states. [2018-11-06 21:03:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20089 states to 20089 states and 22513 transitions. [2018-11-06 21:03:53,318 INFO L78 Accepts]: Start accepts. Automaton has 20089 states and 22513 transitions. Word has length 381 [2018-11-06 21:03:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:53,319 INFO L480 AbstractCegarLoop]: Abstraction has 20089 states and 22513 transitions. [2018-11-06 21:03:53,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-06 21:03:53,319 INFO L276 IsEmpty]: Start isEmpty. Operand 20089 states and 22513 transitions. [2018-11-06 21:03:53,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-11-06 21:03:53,332 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:53,332 INFO L375 BasicCegarLoop]: trace histogram [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, 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, 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, 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, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-06 21:03:53,332 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:53,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:53,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1940323520, now seen corresponding path program 1 times [2018-11-06 21:03:53,333 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:53,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:53,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:53,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:53,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:53,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:53,738 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 314 proven. 5 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-11-06 21:03:53,738 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:53,738 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:53,746 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:53,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:53,847 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:53,926 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2018-11-06 21:03:53,946 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-06 21:03:53,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2018-11-06 21:03:53,947 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:03:53,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:03:53,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:53,947 INFO L87 Difference]: Start difference. First operand 20089 states and 22513 transitions. Second operand 4 states. [2018-11-06 21:03:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:55,059 INFO L93 Difference]: Finished difference Result 39620 states and 44433 transitions. [2018-11-06 21:03:55,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-06 21:03:55,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 397 [2018-11-06 21:03:55,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:55,079 INFO L225 Difference]: With dead ends: 39620 [2018-11-06 21:03:55,079 INFO L226 Difference]: Without dead ends: 19903 [2018-11-06 21:03:55,090 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 398 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:03:55,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19903 states. [2018-11-06 21:03:55,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19903 to 19715. [2018-11-06 21:03:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19715 states. [2018-11-06 21:03:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19715 states to 19715 states and 22052 transitions. [2018-11-06 21:03:55,248 INFO L78 Accepts]: Start accepts. Automaton has 19715 states and 22052 transitions. Word has length 397 [2018-11-06 21:03:55,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:55,248 INFO L480 AbstractCegarLoop]: Abstraction has 19715 states and 22052 transitions. [2018-11-06 21:03:55,248 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:03:55,249 INFO L276 IsEmpty]: Start isEmpty. Operand 19715 states and 22052 transitions. [2018-11-06 21:03:55,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-11-06 21:03:55,262 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:55,262 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-11-06 21:03:55,262 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:55,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 260564265, now seen corresponding path program 1 times [2018-11-06 21:03:55,263 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:55,263 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:55,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:55,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:55,835 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 426 proven. 79 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-06 21:03:55,836 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:03:55,836 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:03:55,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:03:56,091 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:03:56,317 INFO L134 CoverageAnalysis]: Checked inductivity of 685 backedges. 426 proven. 79 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2018-11-06 21:03:56,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:03:56,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 21:03:56,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:03:56,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:03:56,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:03:56,355 INFO L87 Difference]: Start difference. First operand 19715 states and 22052 transitions. Second operand 5 states. [2018-11-06 21:03:59,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:03:59,086 INFO L93 Difference]: Finished difference Result 43338 states and 48319 transitions. [2018-11-06 21:03:59,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-06 21:03:59,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 434 [2018-11-06 21:03:59,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:03:59,107 INFO L225 Difference]: With dead ends: 43338 [2018-11-06 21:03:59,107 INFO L226 Difference]: Without dead ends: 23995 [2018-11-06 21:03:59,119 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 439 GetRequests, 433 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-11-06 21:03:59,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23995 states. [2018-11-06 21:03:59,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23995 to 20268. [2018-11-06 21:03:59,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20268 states. [2018-11-06 21:03:59,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20268 states to 20268 states and 22494 transitions. [2018-11-06 21:03:59,297 INFO L78 Accepts]: Start accepts. Automaton has 20268 states and 22494 transitions. Word has length 434 [2018-11-06 21:03:59,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:03:59,297 INFO L480 AbstractCegarLoop]: Abstraction has 20268 states and 22494 transitions. [2018-11-06 21:03:59,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:03:59,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20268 states and 22494 transitions. [2018-11-06 21:03:59,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2018-11-06 21:03:59,311 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:03:59,312 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2018-11-06 21:03:59,312 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:03:59,312 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:03:59,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1558517667, now seen corresponding path program 1 times [2018-11-06 21:03:59,312 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:03:59,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:03:59,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:59,313 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:03:59,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:03:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:00,055 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 311 proven. 314 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 21:04:00,055 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:00,055 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:00,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:00,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:00,195 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:03,508 WARN L179 SmtUtils]: Spent 2.63 s on a formula simplification. DAG size of input: 261 DAG size of output: 51 [2018-11-06 21:04:07,784 INFO L134 CoverageAnalysis]: Checked inductivity of 776 backedges. 217 proven. 408 refuted. 0 times theorem prover too weak. 151 trivial. 0 not checked. [2018-11-06 21:04:07,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:07,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2018-11-06 21:04:07,805 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-06 21:04:07,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-06 21:04:07,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-06 21:04:07,806 INFO L87 Difference]: Start difference. First operand 20268 states and 22494 transitions. Second operand 12 states. [2018-11-06 21:04:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:21,234 INFO L93 Difference]: Finished difference Result 50592 states and 56227 transitions. [2018-11-06 21:04:21,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-06 21:04:21,234 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 546 [2018-11-06 21:04:21,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:21,263 INFO L225 Difference]: With dead ends: 50592 [2018-11-06 21:04:21,263 INFO L226 Difference]: Without dead ends: 30510 [2018-11-06 21:04:21,275 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 555 GetRequests, 494 SyntacticMatches, 47 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=84, Invalid=156, Unknown=0, NotChecked=0, Total=240 [2018-11-06 21:04:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30510 states. [2018-11-06 21:04:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30510 to 23054. [2018-11-06 21:04:21,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23054 states. [2018-11-06 21:04:21,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23054 states to 23054 states and 25467 transitions. [2018-11-06 21:04:21,566 INFO L78 Accepts]: Start accepts. Automaton has 23054 states and 25467 transitions. Word has length 546 [2018-11-06 21:04:21,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:21,566 INFO L480 AbstractCegarLoop]: Abstraction has 23054 states and 25467 transitions. [2018-11-06 21:04:21,566 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-06 21:04:21,567 INFO L276 IsEmpty]: Start isEmpty. Operand 23054 states and 25467 transitions. [2018-11-06 21:04:21,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-11-06 21:04:21,584 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:21,585 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 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] [2018-11-06 21:04:21,585 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:21,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:21,585 INFO L82 PathProgramCache]: Analyzing trace with hash 606563915, now seen corresponding path program 1 times [2018-11-06 21:04:21,585 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:21,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:21,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:21,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:21,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:22,269 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 373 proven. 55 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-06 21:04:22,269 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:22,269 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:22,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:22,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:22,738 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 29 [2018-11-06 21:04:23,373 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 229 proven. 199 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2018-11-06 21:04:23,394 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:23,394 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2018-11-06 21:04:23,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-06 21:04:23,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-06 21:04:23,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2018-11-06 21:04:23,395 INFO L87 Difference]: Start difference. First operand 23054 states and 25467 transitions. Second operand 11 states. [2018-11-06 21:04:33,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:33,377 INFO L93 Difference]: Finished difference Result 50575 states and 55959 transitions. [2018-11-06 21:04:33,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-06 21:04:33,377 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 557 [2018-11-06 21:04:33,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:33,403 INFO L225 Difference]: With dead ends: 50575 [2018-11-06 21:04:33,403 INFO L226 Difference]: Without dead ends: 27522 [2018-11-06 21:04:33,417 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 593 GetRequests, 569 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=199, Invalid=451, Unknown=0, NotChecked=0, Total=650 [2018-11-06 21:04:33,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27522 states. [2018-11-06 21:04:33,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27522 to 22121. [2018-11-06 21:04:33,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22121 states. [2018-11-06 21:04:33,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22121 states to 22121 states and 24139 transitions. [2018-11-06 21:04:33,639 INFO L78 Accepts]: Start accepts. Automaton has 22121 states and 24139 transitions. Word has length 557 [2018-11-06 21:04:33,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:33,639 INFO L480 AbstractCegarLoop]: Abstraction has 22121 states and 24139 transitions. [2018-11-06 21:04:33,639 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-06 21:04:33,639 INFO L276 IsEmpty]: Start isEmpty. Operand 22121 states and 24139 transitions. [2018-11-06 21:04:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2018-11-06 21:04:33,656 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:33,656 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 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] [2018-11-06 21:04:33,657 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:33,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:33,657 INFO L82 PathProgramCache]: Analyzing trace with hash -1408517502, now seen corresponding path program 1 times [2018-11-06 21:04:33,657 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:33,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:33,658 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:33,658 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:33,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:34,464 WARN L179 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2018-11-06 21:04:34,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 809 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2018-11-06 21:04:34,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-06 21:04:34,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-06 21:04:34,746 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-06 21:04:34,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-06 21:04:34,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:34,746 INFO L87 Difference]: Start difference. First operand 22121 states and 24139 transitions. Second operand 4 states. [2018-11-06 21:04:37,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:37,128 INFO L93 Difference]: Finished difference Result 41837 states and 45756 transitions. [2018-11-06 21:04:37,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-06 21:04:37,129 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 569 [2018-11-06 21:04:37,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:37,147 INFO L225 Difference]: With dead ends: 41837 [2018-11-06 21:04:37,147 INFO L226 Difference]: Without dead ends: 20456 [2018-11-06 21:04:37,158 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-06 21:04:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20456 states. [2018-11-06 21:04:37,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20456 to 19702. [2018-11-06 21:04:37,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19702 states. [2018-11-06 21:04:37,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19702 states to 19702 states and 21326 transitions. [2018-11-06 21:04:37,334 INFO L78 Accepts]: Start accepts. Automaton has 19702 states and 21326 transitions. Word has length 569 [2018-11-06 21:04:37,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:37,334 INFO L480 AbstractCegarLoop]: Abstraction has 19702 states and 21326 transitions. [2018-11-06 21:04:37,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-06 21:04:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 19702 states and 21326 transitions. [2018-11-06 21:04:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-11-06 21:04:37,350 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:37,351 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 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, 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] [2018-11-06 21:04:37,351 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:37,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:37,352 INFO L82 PathProgramCache]: Analyzing trace with hash -2011769998, now seen corresponding path program 1 times [2018-11-06 21:04:37,352 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:37,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:37,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:37,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:37,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 669 proven. 239 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-06 21:04:37,813 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:37,813 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:37,821 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:37,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:37,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:38,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1200 backedges. 669 proven. 239 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2018-11-06 21:04:38,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:38,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3] total 4 [2018-11-06 21:04:38,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-06 21:04:38,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-06 21:04:38,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:38,340 INFO L87 Difference]: Start difference. First operand 19702 states and 21326 transitions. Second operand 5 states. [2018-11-06 21:04:40,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:40,625 INFO L93 Difference]: Finished difference Result 46459 states and 50212 transitions. [2018-11-06 21:04:40,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-06 21:04:40,626 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 618 [2018-11-06 21:04:40,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:40,644 INFO L225 Difference]: With dead ends: 46459 [2018-11-06 21:04:40,644 INFO L226 Difference]: Without dead ends: 20616 [2018-11-06 21:04:40,657 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 621 GetRequests, 617 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-06 21:04:40,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20616 states. [2018-11-06 21:04:40,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20616 to 16342. [2018-11-06 21:04:40,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16342 states. [2018-11-06 21:04:40,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16342 states to 16342 states and 17334 transitions. [2018-11-06 21:04:40,827 INFO L78 Accepts]: Start accepts. Automaton has 16342 states and 17334 transitions. Word has length 618 [2018-11-06 21:04:40,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:40,827 INFO L480 AbstractCegarLoop]: Abstraction has 16342 states and 17334 transitions. [2018-11-06 21:04:40,828 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-06 21:04:40,828 INFO L276 IsEmpty]: Start isEmpty. Operand 16342 states and 17334 transitions. [2018-11-06 21:04:40,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-11-06 21:04:40,839 INFO L367 BasicCegarLoop]: Found error trace [2018-11-06 21:04:40,840 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-11-06 21:04:40,840 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-06 21:04:40,840 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-06 21:04:40,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1089060527, now seen corresponding path program 1 times [2018-11-06 21:04:40,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-06 21:04:40,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-06 21:04:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:40,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:40,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-06 21:04:40,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 1168 proven. 205 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2018-11-06 21:04:41,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-06 21:04:41,768 INFO L225 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-06 21:04:41,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-06 21:04:41,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-06 21:04:41,974 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-06 21:04:43,822 WARN L179 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 619 DAG size of output: 49 [2018-11-06 21:04:46,382 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 460 proven. 343 refuted. 0 times theorem prover too weak. 1339 trivial. 0 not checked. [2018-11-06 21:04:46,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-06 21:04:46,403 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5] total 7 [2018-11-06 21:04:46,404 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-06 21:04:46,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-06 21:04:46,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-06 21:04:46,404 INFO L87 Difference]: Start difference. First operand 16342 states and 17334 transitions. Second operand 8 states. [2018-11-06 21:04:56,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-06 21:04:56,432 INFO L93 Difference]: Finished difference Result 37897 states and 40161 transitions. [2018-11-06 21:04:56,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-06 21:04:56,433 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 745 [2018-11-06 21:04:56,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-06 21:04:56,433 INFO L225 Difference]: With dead ends: 37897 [2018-11-06 21:04:56,433 INFO L226 Difference]: Without dead ends: 0 [2018-11-06 21:04:56,445 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 758 GetRequests, 695 SyntacticMatches, 48 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2018-11-06 21:04:56,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-06 21:04:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-06 21:04:56,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-06 21:04:56,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-06 21:04:56,446 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 745 [2018-11-06 21:04:56,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-06 21:04:56,446 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-06 21:04:56,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-06 21:04:56,447 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-06 21:04:56,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-06 21:04:56,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-06 21:04:56,580 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:56,595 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:56,627 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:57,841 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:57,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,096 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,103 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,394 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,414 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,554 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,573 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,593 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:58,733 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,178 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,226 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,227 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,250 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,380 WARN L179 SmtUtils]: Spent 2.92 s on a formula simplification. DAG size of input: 892 DAG size of output: 710 [2018-11-06 21:04:59,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,480 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:04:59,504 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:00,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:00,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:00,783 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:00,789 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:00,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,024 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,041 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,168 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,185 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,186 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,206 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,334 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,589 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,734 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,784 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,786 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,808 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-06 21:05:01,927 WARN L179 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 892 DAG size of output: 710 [2018-11-06 21:05:11,477 WARN L179 SmtUtils]: Spent 9.54 s on a formula simplification. DAG size of input: 678 DAG size of output: 122 [2018-11-06 21:05:20,810 WARN L179 SmtUtils]: Spent 9.33 s on a formula simplification. DAG size of input: 678 DAG size of output: 122 [2018-11-06 21:05:20,814 INFO L425 ceAbstractionStarter]: For program point L168(line 168) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L102(line 102) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L36(line 36) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L428 ceAbstractionStarter]: At program point L1028(lines 1028 1044) the Hoare annotation is: true [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L566(lines 566 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L500(lines 500 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L170(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L104(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L38(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L963(lines 963 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,815 INFO L425 ceAbstractionStarter]: For program point L831(lines 831 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L171(line 171) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L898(lines 898 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L635(lines 635 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L305(lines 305 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,816 INFO L425 ceAbstractionStarter]: For program point L173-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L107(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L41(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L240(lines 240 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L174(line 174) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L108(line 108) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L42(line 42) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L769(lines 769 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,817 INFO L425 ceAbstractionStarter]: For program point L1034-1(lines 1034 1043) no Hoare annotation was computed. [2018-11-06 21:05:20,818 INFO L421 ceAbstractionStarter]: At program point L1034-3(lines 1034 1043) the Hoare annotation is: (let ((.cse6 (= ~a25~0 9))) (let ((.cse1 (= ~a25~0 12)) (.cse25 (+ ~a23~0 43)) (.cse21 (= ~a25~0 13)) (.cse15 (= ~a4~0 1)) (.cse26 (< 277 ~a29~0)) (.cse14 (not .cse6)) (.cse10 (< 245 ~a29~0))) (let ((.cse5 (<= ~a29~0 140)) (.cse9 (<= ~a25~0 12)) (.cse19 (<= ~a29~0 274)) (.cse16 (<= 312 ~a23~0)) (.cse22 (and .cse14 .cse10)) (.cse17 (or (and .cse21 .cse15) .cse26)) (.cse0 (<= ~a4~0 0)) (.cse7 (= 1 ~a4~0)) (.cse8 (< 138 ~a23~0)) (.cse2 (= 1 ~a3~0)) (.cse11 (< 0 .cse25)) (.cse23 (<= ~a29~0 277)) (.cse20 (<= 141 ~a29~0)) (.cse18 (or .cse26 (and .cse15 (not .cse1)))) (.cse3 (= 15 ~a8~0)) (.cse12 (<= ~a23~0 247)) (.cse24 (= ~a8~0 15)) (.cse4 (= ~a25~0 10)) (.cse13 (<= .cse25 0))) (or (and (and (and .cse0 (<= ~a29~0 275) .cse1) .cse2) .cse3) (and .cse0 .cse2 .cse3 (and .cse4 .cse5)) (and .cse6 .cse3 .cse7 .cse8 .cse5 .cse2) (and (and .cse2 .cse9 .cse10 .cse7 .cse8) .cse3) (and (and .cse2 .cse3 .cse10 .cse7) .cse6) (and .cse5 .cse0 .cse2 .cse11 .cse3 .cse12) (and .cse0 .cse2 (exists ((v_~a29~0_507 Int)) (and (< 140 v_~a29~0_507) (<= v_~a29~0_507 245) (= (+ ~a29~0 554771) (* 3 v_~a29~0_507)))) .cse3 .cse13) (and .cse14 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse12 (not .cse4)) (and .cse1 .cse2 .cse15 .cse3 .cse16) (and (and .cse0 .cse17 .cse2) .cse3 .cse13) (and .cse3 .cse7 .cse11 .cse2 .cse9 (<= 115959 ~a29~0)) (and .cse18 .cse3 .cse14 .cse2 .cse19 .cse9 .cse20) (and .cse21 .cse2 .cse3 .cse7 .cse8) (and (and (and .cse0 .cse22 .cse19) .cse2) .cse3 .cse12) (and .cse10 .cse2 .cse19 .cse18 .cse3 .cse12) (and .cse2 .cse15 .cse3 .cse4) (and (and (and .cse2 .cse9 .cse10) .cse23) .cse18 .cse3) (and .cse2 .cse12 (and .cse1 .cse24 (and .cse15 .cse5))) (and (and .cse14 .cse2 .cse18 (<= ~a23~0 306) .cse9 .cse7 .cse8) .cse3) (and .cse21 (and .cse2 .cse19 .cse3 .cse20 .cse7)) (and .cse2 (and .cse1 .cse7 .cse12 .cse8) .cse3) (and .cse2 (and .cse15 .cse20 .cse16) .cse3) (and .cse0 .cse22 .cse17 .cse2 .cse3 .cse12) (and .cse14 .cse0 .cse2 .cse3 .cse13) (and .cse3 .cse7 .cse8 .cse1 .cse2 .cse20 (<= ~a29~0 220)) (and (and .cse2 (and .cse11 (not .cse21) .cse23) .cse20) .cse18 .cse3 .cse12) (and .cse24 (and .cse15 .cse4) .cse13))))) [2018-11-06 21:05:20,818 INFO L425 ceAbstractionStarter]: For program point L836(lines 836 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,818 INFO L425 ceAbstractionStarter]: For program point L572(lines 572 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,818 INFO L425 ceAbstractionStarter]: For program point L176(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,818 INFO L425 ceAbstractionStarter]: For program point L110(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,818 INFO L425 ceAbstractionStarter]: For program point L44(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L969(lines 969 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L903(lines 903 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L507(lines 507 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L177(line 177) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L111(line 111) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L45(line 45) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L970(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L904(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:05:20,819 INFO L425 ceAbstractionStarter]: For program point L970-2(lines 970 980) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L904-2(lines 904 914) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L706(lines 706 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L310(lines 310 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L575(lines 575 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L443(lines 443 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L377(lines 377 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L179(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L113(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L47(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,820 INFO L425 ceAbstractionStarter]: For program point L774(lines 774 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L642(lines 642 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L180(line 180) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L114(line 114) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L48(line 48) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L1039(line 1039) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L841(lines 841 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L247(lines 247 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L182(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L116(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,821 INFO L425 ceAbstractionStarter]: For program point L50(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L183(line 183) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L117(line 117) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L712(lines 712 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L647(lines 647 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L581(lines 581 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L515(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L515-2(lines 515 525) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L185(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L119(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L53(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L846(lines 846 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,822 INFO L425 ceAbstractionStarter]: For program point L780(lines 780 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L648(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L648-2(lines 648 657) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L450(lines 450 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L384(lines 384 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L186(line 186) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L120(line 120) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L188(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L122(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L56(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L981(lines 981 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L915(lines 915 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L717(lines 717 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,823 INFO L425 ceAbstractionStarter]: For program point L189(line 189) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L123(line 123) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L916(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L916-2(lines 916 926) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L718(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L718-2(lines 718 730) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L586(lines 586 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L322(lines 322 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L587(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L587-2(lines 587 597) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L191(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L125(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L59(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,824 INFO L425 ceAbstractionStarter]: For program point L852(lines 852 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L456(lines 456 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L192(line 192) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L126(line 126) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L60(line 60) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L787(lines 787 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L391(lines 391 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L194(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,825 INFO L425 ceAbstractionStarter]: For program point L128(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L62(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L195(line 195) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L129(line 129) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L63(line 63) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L988(lines 988 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L658(lines 658 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,826 INFO L425 ceAbstractionStarter]: For program point L197(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L131(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L65(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L792(lines 792 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L198(line 198) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L132(line 132) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L66(line 66) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L859(lines 859 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L463(lines 463 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,827 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L200(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L134(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L68(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L993(lines 993 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L927(lines 927 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L663(lines 663 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L531(lines 531 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,828 INFO L425 ceAbstractionStarter]: For program point L399(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L399-2(lines 399 410) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L201(line 201) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L135(line 135) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L598(lines 598 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L334(lines 334 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L268(lines 268 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L731(lines 731 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L203(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L137(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,829 INFO L425 ceAbstractionStarter]: For program point L71(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L204(line 204) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L72(line 72) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L865(lines 865 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L799(lines 799 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L932(lines 932 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L866(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L866-2(lines 866 875) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L470(lines 470 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,830 INFO L425 ceAbstractionStarter]: For program point L140(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L74(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L603(lines 603 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L537(lines 537 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L141(line 141) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L1000(lines 1000 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L670(lines 670 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L604(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L604-2(lines 604 614) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,831 INFO L425 ceAbstractionStarter]: For program point L275(lines 275 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L143(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L77(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L804(lines 804 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L738(lines 738 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L144(line 144) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L78(line 78) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L805(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L805-2(lines 805 815) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L542(lines 542 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,832 INFO L425 ceAbstractionStarter]: For program point L146(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L80(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L1005(lines 1005 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L939(lines 939 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L675(lines 675 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L477(lines 477 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L411(lines 411 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L147(line 147) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2018-11-06 21:05:20,833 INFO L425 ceAbstractionStarter]: For program point L940(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L940-2(lines 940 952) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L478(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L478-2(lines 478 486) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L346(lines 346 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L280(lines 280 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L214(lines 214 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L743(lines 743 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L149(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,834 INFO L425 ceAbstractionStarter]: For program point L83(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L876(lines 876 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L152(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L86(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L681(lines 681 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L615(lines 615 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,835 INFO L425 ceAbstractionStarter]: For program point L549(lines 549 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L417(lines 417 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L153(line 153) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L87(line 87) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L1012(lines 1012 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L881(lines 881 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L353(lines 353 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L287(lines 287 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L221(lines 221 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,836 INFO L425 ceAbstractionStarter]: For program point L155(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L89(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L23(lines 23 25) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L23-1(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L816(lines 816 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L750(lines 750 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L156(line 156) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L90(line 90) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,837 INFO L425 ceAbstractionStarter]: For program point L488(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L422(lines 422 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L488-2(lines 488 499) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L158(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L92(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L26(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L1017(lines 1017 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L621(lines 621 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L555(lines 555 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L159(line 159) no Hoare annotation was computed. [2018-11-06 21:05:20,838 INFO L425 ceAbstractionStarter]: For program point L93(line 93) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L886(lines 886 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L688(lines 688 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L358(lines 358 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L953(lines 953 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L227(lines 227 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L161(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L95(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,839 INFO L425 ceAbstractionStarter]: For program point L29(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L822(lines 822 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L294(lines 294 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L96(line 96) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L757(lines 757 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L758(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point L758-2(lines 758 768) no Hoare annotation was computed. [2018-11-06 21:05:20,840 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 174) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L164(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L98(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L32(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L825(lines 825 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L561(lines 561 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L429(lines 429 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L165(line 165) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L99(line 99) no Hoare annotation was computed. [2018-11-06 21:05:20,841 INFO L425 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-11-06 21:05:20,842 INFO L425 ceAbstractionStarter]: For program point L958(lines 958 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,842 INFO L425 ceAbstractionStarter]: For program point L694(lines 694 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,842 INFO L425 ceAbstractionStarter]: For program point L628(lines 628 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,842 INFO L421 ceAbstractionStarter]: At program point L1025(lines 22 1026) the Hoare annotation is: (let ((.cse6 (= ~a25~0 9))) (let ((.cse1 (= ~a25~0 12)) (.cse25 (+ ~a23~0 43)) (.cse21 (= ~a25~0 13)) (.cse15 (= ~a4~0 1)) (.cse26 (< 277 ~a29~0)) (.cse14 (not .cse6)) (.cse10 (< 245 ~a29~0))) (let ((.cse5 (<= ~a29~0 140)) (.cse9 (<= ~a25~0 12)) (.cse19 (<= ~a29~0 274)) (.cse16 (<= 312 ~a23~0)) (.cse22 (and .cse14 .cse10)) (.cse17 (or (and .cse21 .cse15) .cse26)) (.cse0 (<= ~a4~0 0)) (.cse7 (= 1 ~a4~0)) (.cse8 (< 138 ~a23~0)) (.cse2 (= 1 ~a3~0)) (.cse11 (< 0 .cse25)) (.cse23 (<= ~a29~0 277)) (.cse20 (<= 141 ~a29~0)) (.cse18 (or .cse26 (and .cse15 (not .cse1)))) (.cse3 (= 15 ~a8~0)) (.cse12 (<= ~a23~0 247)) (.cse24 (= ~a8~0 15)) (.cse4 (= ~a25~0 10)) (.cse13 (<= .cse25 0))) (or (and (and (and .cse0 (<= ~a29~0 275) .cse1) .cse2) .cse3) (and .cse0 .cse2 .cse3 (and .cse4 .cse5)) (and .cse6 .cse3 .cse7 .cse8 .cse5 .cse2) (and (and .cse2 .cse9 .cse10 .cse7 .cse8) .cse3) (and (and .cse2 .cse3 .cse10 .cse7) .cse6) (and .cse5 .cse0 .cse2 .cse11 .cse3 .cse12) (and .cse0 .cse2 (exists ((v_~a29~0_507 Int)) (and (< 140 v_~a29~0_507) (<= v_~a29~0_507 245) (= (+ ~a29~0 554771) (* 3 v_~a29~0_507)))) .cse3 .cse13) (and .cse14 (not (= ~a25~0 11)) .cse0 .cse2 .cse3 .cse12 (not .cse4)) (and .cse1 .cse2 .cse15 .cse3 .cse16) (and (and .cse0 .cse17 .cse2) .cse3 .cse13) (and .cse3 .cse7 .cse11 .cse2 .cse9 (<= 115959 ~a29~0)) (and .cse18 .cse3 .cse14 .cse2 .cse19 .cse9 .cse20) (and .cse21 .cse2 .cse3 .cse7 .cse8) (and (and (and .cse0 .cse22 .cse19) .cse2) .cse3 .cse12) (and .cse10 .cse2 .cse19 .cse18 .cse3 .cse12) (and .cse2 .cse15 .cse3 .cse4) (and (and (and .cse2 .cse9 .cse10) .cse23) .cse18 .cse3) (and .cse2 .cse12 (and .cse1 .cse24 (and .cse15 .cse5))) (and (and .cse14 .cse2 .cse18 (<= ~a23~0 306) .cse9 .cse7 .cse8) .cse3) (and .cse21 (and .cse2 .cse19 .cse3 .cse20 .cse7)) (and .cse2 (and .cse1 .cse7 .cse12 .cse8) .cse3) (and .cse2 (and .cse15 .cse20 .cse16) .cse3) (and .cse0 .cse22 .cse17 .cse2 .cse3 .cse12) (and .cse14 .cse0 .cse2 .cse3 .cse13) (and .cse3 .cse7 .cse8 .cse1 .cse2 .cse20 (<= ~a29~0 220)) (and (and .cse2 (and .cse11 (not .cse21) .cse23) .cse20) .cse18 .cse3 .cse12) (and .cse24 (and .cse15 .cse4) .cse13))))) [2018-11-06 21:05:20,842 INFO L425 ceAbstractionStarter]: For program point L893(lines 893 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L695(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L695-2(lines 695 705) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L299(lines 299 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L233(lines 233 1024) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L167(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L101(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,843 INFO L425 ceAbstractionStarter]: For program point L35(lines 22 1026) no Hoare annotation was computed. [2018-11-06 21:05:20,854 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,855 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,856 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,878 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,879 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,890 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,891 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,896 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:05:20 BoogieIcfgContainer [2018-11-06 21:05:20,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-06 21:05:20,908 INFO L168 Benchmark]: Toolchain (without parser) took 153986.47 ms. Allocated memory was 1.5 GB in the beginning and 4.2 GB in the end (delta: 2.6 GB). Free memory was 1.4 GB in the beginning and 2.7 GB in the end (delta: -1.2 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,911 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-06 21:05:20,911 INFO L168 Benchmark]: CACSL2BoogieTranslator took 911.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,912 INFO L168 Benchmark]: Boogie Procedure Inliner took 295.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,913 INFO L168 Benchmark]: Boogie Preprocessor took 152.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,913 INFO L168 Benchmark]: RCFGBuilder took 4889.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,917 INFO L168 Benchmark]: TraceAbstraction took 147732.28 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -633.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2018-11-06 21:05:20,927 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 911.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 66.1 MB). Peak memory consumption was 66.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 295.46 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 748.7 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -829.3 MB). Peak memory consumption was 22.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 152.37 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4889.49 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.0 GB in the end (delta: 173.6 MB). Peak memory consumption was 173.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 147732.28 ms. Allocated memory was 2.3 GB in the beginning and 4.2 GB in the end (delta: 1.9 GB). Free memory was 2.0 GB in the beginning and 2.7 GB in the end (delta: -633.0 MB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 174]: 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: 1028]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1034]: Loop Invariant [2018-11-06 21:05:20,943 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,944 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,946 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,951 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 <= 0 && a29 <= 275) && a25 == 12) && 1 == a3) && 15 == a8) || (((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10 && a29 <= 140)) || (((((a25 == 9 && 15 == a8) && 1 == a4) && 138 < a23) && a29 <= 140) && 1 == a3)) || (((((1 == a3 && a25 <= 12) && 245 < a29) && 1 == a4) && 138 < a23) && 15 == a8)) || ((((1 == a3 && 15 == a8) && 245 < a29) && 1 == a4) && a25 == 9)) || (((((a29 <= 140 && a4 <= 0) && 1 == a3) && 0 < a23 + 43) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && (\exists v_~a29~0_507 : int :: (140 < v_~a29~0_507 && v_~a29~0_507 <= 245) && a29 + 554771 == 3 * v_~a29~0_507)) && 15 == a8) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && !(a25 == 11)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 <= 247) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((a4 <= 0 && ((a25 == 13 && a4 == 1) || 277 < a29)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && a25 <= 12) && 115959 <= a29)) || (((((((277 < a29 || (a4 == 1 && !(a25 == 12))) && 15 == a8) && !(a25 == 9)) && 1 == a3) && a29 <= 274) && a25 <= 12) && 141 <= a29)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a4 <= 0 && !(a25 == 9) && 245 < a29) && a29 <= 274) && 1 == a3) && 15 == a8) && a23 <= 247)) || (((((245 < a29 && 1 == a3) && a29 <= 274) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8) && a23 <= 247)) || (((1 == a3 && a4 == 1) && 15 == a8) && a25 == 10)) || (((((1 == a3 && a25 <= 12) && 245 < a29) && a29 <= 277) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8)) || ((1 == a3 && a23 <= 247) && (a25 == 12 && a8 == 15) && a4 == 1 && a29 <= 140)) || (((((((!(a25 == 9) && 1 == a3) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && a23 <= 306) && a25 <= 12) && 1 == a4) && 138 < a23) && 15 == a8)) || (a25 == 13 && (((1 == a3 && a29 <= 274) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((1 == a3 && ((a25 == 12 && 1 == a4) && a23 <= 247) && 138 < a23) && 15 == a8)) || ((1 == a3 && (a4 == 1 && 141 <= a29) && 312 <= a23) && 15 == a8)) || (((((a4 <= 0 && !(a25 == 9) && 245 < a29) && ((a25 == 13 && a4 == 1) || 277 < a29)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((!(a25 == 9) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((((15 == a8 && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3) && 141 <= a29) && a29 <= 220)) || (((((1 == a3 && (0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 141 <= a29) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8) && a23 <= 247)) || ((a8 == 15 && a4 == 1 && a25 == 10) && a23 + 43 <= 0) - InvariantResult [Line: 22]: Loop Invariant [2018-11-06 21:05:20,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,953 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,956 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,956 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] [2018-11-06 21:05:20,957 WARN L387 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_~a29~0_507,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((((a4 <= 0 && a29 <= 275) && a25 == 12) && 1 == a3) && 15 == a8) || (((a4 <= 0 && 1 == a3) && 15 == a8) && a25 == 10 && a29 <= 140)) || (((((a25 == 9 && 15 == a8) && 1 == a4) && 138 < a23) && a29 <= 140) && 1 == a3)) || (((((1 == a3 && a25 <= 12) && 245 < a29) && 1 == a4) && 138 < a23) && 15 == a8)) || ((((1 == a3 && 15 == a8) && 245 < a29) && 1 == a4) && a25 == 9)) || (((((a29 <= 140 && a4 <= 0) && 1 == a3) && 0 < a23 + 43) && 15 == a8) && a23 <= 247)) || ((((a4 <= 0 && 1 == a3) && (\exists v_~a29~0_507 : int :: (140 < v_~a29~0_507 && v_~a29~0_507 <= 245) && a29 + 554771 == 3 * v_~a29~0_507)) && 15 == a8) && a23 + 43 <= 0)) || ((((((!(a25 == 9) && !(a25 == 11)) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 <= 247) && !(a25 == 10))) || ((((a25 == 12 && 1 == a3) && a4 == 1) && 15 == a8) && 312 <= a23)) || ((((a4 <= 0 && ((a25 == 13 && a4 == 1) || 277 < a29)) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || (((((15 == a8 && 1 == a4) && 0 < a23 + 43) && 1 == a3) && a25 <= 12) && 115959 <= a29)) || (((((((277 < a29 || (a4 == 1 && !(a25 == 12))) && 15 == a8) && !(a25 == 9)) && 1 == a3) && a29 <= 274) && a25 <= 12) && 141 <= a29)) || ((((a25 == 13 && 1 == a3) && 15 == a8) && 1 == a4) && 138 < a23)) || (((((a4 <= 0 && !(a25 == 9) && 245 < a29) && a29 <= 274) && 1 == a3) && 15 == a8) && a23 <= 247)) || (((((245 < a29 && 1 == a3) && a29 <= 274) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8) && a23 <= 247)) || (((1 == a3 && a4 == 1) && 15 == a8) && a25 == 10)) || (((((1 == a3 && a25 <= 12) && 245 < a29) && a29 <= 277) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8)) || ((1 == a3 && a23 <= 247) && (a25 == 12 && a8 == 15) && a4 == 1 && a29 <= 140)) || (((((((!(a25 == 9) && 1 == a3) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && a23 <= 306) && a25 <= 12) && 1 == a4) && 138 < a23) && 15 == a8)) || (a25 == 13 && (((1 == a3 && a29 <= 274) && 15 == a8) && 141 <= a29) && 1 == a4)) || ((1 == a3 && ((a25 == 12 && 1 == a4) && a23 <= 247) && 138 < a23) && 15 == a8)) || ((1 == a3 && (a4 == 1 && 141 <= a29) && 312 <= a23) && 15 == a8)) || (((((a4 <= 0 && !(a25 == 9) && 245 < a29) && ((a25 == 13 && a4 == 1) || 277 < a29)) && 1 == a3) && 15 == a8) && a23 <= 247)) || ((((!(a25 == 9) && a4 <= 0) && 1 == a3) && 15 == a8) && a23 + 43 <= 0)) || ((((((15 == a8 && 1 == a4) && 138 < a23) && a25 == 12) && 1 == a3) && 141 <= a29) && a29 <= 220)) || (((((1 == a3 && (0 < a23 + 43 && !(a25 == 13)) && a29 <= 277) && 141 <= a29) && (277 < a29 || (a4 == 1 && !(a25 == 12)))) && 15 == a8) && a23 <= 247)) || ((a8 == 15 && a4 == 1 && a25 == 10) && a23 + 43 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 284 locations, 1 error locations. SAFE Result, 147.5s OverallTime, 18 OverallIterations, 8 TraceHistogramMax, 89.5s AutomataDifference, 0.0s DeadEndRemovalTime, 24.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 3958 SDtfs, 17578 SDslu, 3202 SDs, 0 SdLazy, 47666 SolverSat, 6789 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 71.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4257 GetRequests, 3989 SyntacticMatches, 150 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 19.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25880occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 3.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 42526 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 352 NumberOfFragments, 1239 HoareAnnotationTreeSize, 3 FomulaSimplifications, 445442 FormulaSimplificationTreeSizeReduction, 5.4s HoareSimplificationTime, 3 FomulaSimplificationsInter, 269870 FormulaSimplificationTreeSizeReductionInter, 18.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 24.4s InterpolantComputationTime, 10789 NumberOfCodeBlocks, 10789 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 10762 ConstructedInterpolants, 411 QuantifiedInterpolants, 32889518 SizeOfPredicates, 27 NumberOfNonLiveVariables, 5403 ConjunctsInSsa, 80 ConjunctsInUnsatCore, 27 InterpolantComputations, 12 PerfectInterpolantSequences, 13620/16265 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...