./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem16_label29_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem16_label29_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b58a35b82358ba5160d6216f8f839a69fd1d9edf ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 04:40:51,104 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:40:51,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:40:51,118 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:40:51,118 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:40:51,119 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:40:51,122 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:40:51,124 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:40:51,126 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:40:51,127 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:40:51,133 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:40:51,134 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:40:51,135 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:40:51,141 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:40:51,143 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:40:51,147 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:40:51,147 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:40:51,149 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:40:51,153 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:40:51,155 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:40:51,156 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:40:51,157 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:40:51,159 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:40:51,160 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:40:51,160 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:40:51,161 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:40:51,162 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:40:51,163 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:40:51,164 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:40:51,165 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:40:51,165 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:40:51,165 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:40:51,166 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:40:51,166 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:40:51,168 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:40:51,168 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:40:51,169 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:40:51,184 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:40:51,184 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:40:51,185 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:40:51,186 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:40:51,186 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:40:51,186 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:40:51,186 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:40:51,186 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:40:51,187 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:40:51,188 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:40:51,189 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:40:51,189 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:40:51,190 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:40:51,190 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:40:51,190 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:40:51,190 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:40:51,190 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:40:51,190 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:40:51,191 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:40:51,192 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:40:51,192 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:40:51,192 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:40:51,192 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:40:51,192 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b58a35b82358ba5160d6216f8f839a69fd1d9edf [2019-01-12 04:40:51,233 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:40:51,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:40:51,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:40:51,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:40:51,259 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:40:51,260 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem16_label29_true-unreach-call.c [2019-01-12 04:40:51,325 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091f39921/50682667d47b4301b2b228c4ef5fd555/FLAG1807a5434 [2019-01-12 04:40:52,045 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:40:52,046 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem16_label29_true-unreach-call.c [2019-01-12 04:40:52,067 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091f39921/50682667d47b4301b2b228c4ef5fd555/FLAG1807a5434 [2019-01-12 04:40:52,158 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/091f39921/50682667d47b4301b2b228c4ef5fd555 [2019-01-12 04:40:52,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:40:52,167 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:40:52,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:40:52,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:40:52,173 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:40:52,174 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:40:52" (1/1) ... [2019-01-12 04:40:52,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b7e223 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:52, skipping insertion in model container [2019-01-12 04:40:52,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:40:52" (1/1) ... [2019-01-12 04:40:52,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:40:52,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:40:53,137 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:40:53,148 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:40:53,453 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:40:53,628 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:40:53,629 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53 WrapperNode [2019-01-12 04:40:53,629 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:40:53,630 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:40:53,630 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:40:53,630 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:40:53,639 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,692 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,846 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:40:53,846 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:40:53,846 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:40:53,847 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:40:53,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,871 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,872 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,938 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,968 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:53,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... [2019-01-12 04:40:54,026 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:40:54,027 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:40:54,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:40:54,029 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:40:54,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:40:54,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:40:54,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:40:59,967 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:40:59,967 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:40:59,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:40:59 BoogieIcfgContainer [2019-01-12 04:40:59,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:40:59,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:40:59,971 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:40:59,974 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:40:59,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:40:52" (1/3) ... [2019-01-12 04:40:59,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:40:59, skipping insertion in model container [2019-01-12 04:40:59,976 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:40:53" (2/3) ... [2019-01-12 04:40:59,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@504fddb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:40:59, skipping insertion in model container [2019-01-12 04:40:59,978 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:40:59" (3/3) ... [2019-01-12 04:40:59,980 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label29_true-unreach-call.c [2019-01-12 04:40:59,990 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:41:00,006 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:41:00,027 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:41:00,075 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:41:00,076 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:41:00,076 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:41:00,076 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:41:00,076 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:41:00,076 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:41:00,076 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:41:00,077 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:41:00,077 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:41:00,105 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states. [2019-01-12 04:41:00,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-01-12 04:41:00,116 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:00,117 INFO L402 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] [2019-01-12 04:41:00,123 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:00,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 291089130, now seen corresponding path program 1 times [2019-01-12 04:41:00,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:00,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:00,174 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:00,174 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:00,175 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:00,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:00,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:41:00,564 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:00,565 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:41:00,570 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:41:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:41:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:00,594 INFO L87 Difference]: Start difference. First operand 396 states. Second operand 4 states. [2019-01-12 04:41:06,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:06,384 INFO L93 Difference]: Finished difference Result 1469 states and 2777 transitions. [2019-01-12 04:41:06,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:41:06,386 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-01-12 04:41:06,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:06,433 INFO L225 Difference]: With dead ends: 1469 [2019-01-12 04:41:06,434 INFO L226 Difference]: Without dead ends: 991 [2019-01-12 04:41:06,441 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:06,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2019-01-12 04:41:06,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 662. [2019-01-12 04:41:06,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 662 states. [2019-01-12 04:41:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2019-01-12 04:41:06,571 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 46 [2019-01-12 04:41:06,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:06,571 INFO L480 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2019-01-12 04:41:06,572 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:41:06,572 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2019-01-12 04:41:06,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-01-12 04:41:06,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:06,578 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:06,578 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:06,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:06,579 INFO L82 PathProgramCache]: Analyzing trace with hash 424951881, now seen corresponding path program 1 times [2019-01-12 04:41:06,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:06,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:06,581 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:06,581 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:06,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:06,858 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:41:06,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:06,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:41:06,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:41:06,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:41:06,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:06,863 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand 4 states. [2019-01-12 04:41:11,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:11,059 INFO L93 Difference]: Finished difference Result 2638 states and 4488 transitions. [2019-01-12 04:41:11,060 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:41:11,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-01-12 04:41:11,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:11,071 INFO L225 Difference]: With dead ends: 2638 [2019-01-12 04:41:11,071 INFO L226 Difference]: Without dead ends: 1978 [2019-01-12 04:41:11,076 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:11,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2019-01-12 04:41:11,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2019-01-12 04:41:11,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1978 states. [2019-01-12 04:41:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2998 transitions. [2019-01-12 04:41:11,129 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2998 transitions. Word has length 112 [2019-01-12 04:41:11,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:11,130 INFO L480 AbstractCegarLoop]: Abstraction has 1978 states and 2998 transitions. [2019-01-12 04:41:11,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:41:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2998 transitions. [2019-01-12 04:41:11,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 04:41:11,133 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:11,134 INFO L402 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:11,134 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:11,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:11,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2022314381, now seen corresponding path program 1 times [2019-01-12 04:41:11,134 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:11,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:11,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:11,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:11,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:11,436 WARN L181 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:41:11,621 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-01-12 04:41:11,756 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:41:11,756 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:11,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 04:41:11,757 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:41:11,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:41:11,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:41:11,758 INFO L87 Difference]: Start difference. First operand 1978 states and 2998 transitions. Second operand 6 states. [2019-01-12 04:41:18,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:18,258 INFO L93 Difference]: Finished difference Result 6277 states and 9398 transitions. [2019-01-12 04:41:18,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:41:18,260 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 125 [2019-01-12 04:41:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:18,288 INFO L225 Difference]: With dead ends: 6277 [2019-01-12 04:41:18,288 INFO L226 Difference]: Without dead ends: 4301 [2019-01-12 04:41:18,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:41:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4301 states. [2019-01-12 04:41:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4301 to 4281. [2019-01-12 04:41:18,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4281 states. [2019-01-12 04:41:18,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 6124 transitions. [2019-01-12 04:41:18,394 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 6124 transitions. Word has length 125 [2019-01-12 04:41:18,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:18,396 INFO L480 AbstractCegarLoop]: Abstraction has 4281 states and 6124 transitions. [2019-01-12 04:41:18,397 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:41:18,397 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 6124 transitions. [2019-01-12 04:41:18,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-01-12 04:41:18,409 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:18,410 INFO L402 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, 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] [2019-01-12 04:41:18,411 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:18,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:18,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2125442590, now seen corresponding path program 1 times [2019-01-12 04:41:18,411 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:18,412 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:18,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:18,414 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:18,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:18,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:18,804 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-01-12 04:41:18,805 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:18,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 04:41:18,806 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:41:18,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:41:18,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:41:18,808 INFO L87 Difference]: Start difference. First operand 4281 states and 6124 transitions. Second operand 3 states. [2019-01-12 04:41:20,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:20,546 INFO L93 Difference]: Finished difference Result 11850 states and 17091 transitions. [2019-01-12 04:41:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:41:20,550 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 212 [2019-01-12 04:41:20,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:20,588 INFO L225 Difference]: With dead ends: 11850 [2019-01-12 04:41:20,588 INFO L226 Difference]: Without dead ends: 7900 [2019-01-12 04:41:20,598 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:41:20,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7900 states. [2019-01-12 04:41:20,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7900 to 6255. [2019-01-12 04:41:20,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2019-01-12 04:41:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 8531 transitions. [2019-01-12 04:41:20,766 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 8531 transitions. Word has length 212 [2019-01-12 04:41:20,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:20,768 INFO L480 AbstractCegarLoop]: Abstraction has 6255 states and 8531 transitions. [2019-01-12 04:41:20,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:41:20,769 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 8531 transitions. [2019-01-12 04:41:20,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2019-01-12 04:41:20,782 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:20,782 INFO L402 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, 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, 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] [2019-01-12 04:41:20,783 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:20,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:20,784 INFO L82 PathProgramCache]: Analyzing trace with hash 440332549, now seen corresponding path program 1 times [2019-01-12 04:41:20,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:20,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:20,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:20,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:20,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:21,222 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 04:41:21,668 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 193 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 04:41:21,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:21,669 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:41:21,669 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:41:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:41:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:41:21,670 INFO L87 Difference]: Start difference. First operand 6255 states and 8531 transitions. Second operand 7 states. [2019-01-12 04:41:23,010 WARN L181 SmtUtils]: Spent 167.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 04:41:27,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:27,091 INFO L93 Difference]: Finished difference Result 12232 states and 16772 transitions. [2019-01-12 04:41:27,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:41:27,092 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 350 [2019-01-12 04:41:27,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:27,117 INFO L225 Difference]: With dead ends: 12232 [2019-01-12 04:41:27,117 INFO L226 Difference]: Without dead ends: 6308 [2019-01-12 04:41:27,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:41:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6308 states. [2019-01-12 04:41:27,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6308 to 6255. [2019-01-12 04:41:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2019-01-12 04:41:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 8525 transitions. [2019-01-12 04:41:27,244 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 8525 transitions. Word has length 350 [2019-01-12 04:41:27,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:27,245 INFO L480 AbstractCegarLoop]: Abstraction has 6255 states and 8525 transitions. [2019-01-12 04:41:27,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:41:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 8525 transitions. [2019-01-12 04:41:27,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-01-12 04:41:27,256 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:27,256 INFO L402 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:27,257 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:27,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:27,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1305413249, now seen corresponding path program 1 times [2019-01-12 04:41:27,257 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:27,257 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:27,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:27,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:27,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:27,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:27,868 WARN L181 SmtUtils]: Spent 160.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 04:41:28,171 WARN L181 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2019-01-12 04:41:28,408 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 173 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:41:28,408 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:28,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:41:28,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 04:41:28,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 04:41:28,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:41:28,410 INFO L87 Difference]: Start difference. First operand 6255 states and 8525 transitions. Second operand 7 states. [2019-01-12 04:41:30,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:30,992 INFO L93 Difference]: Finished difference Result 12367 states and 16901 transitions. [2019-01-12 04:41:30,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:41:30,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 378 [2019-01-12 04:41:30,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:31,015 INFO L225 Difference]: With dead ends: 12367 [2019-01-12 04:41:31,015 INFO L226 Difference]: Without dead ends: 6255 [2019-01-12 04:41:31,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-12 04:41:31,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2019-01-12 04:41:31,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2019-01-12 04:41:31,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6255 states. [2019-01-12 04:41:31,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 7175 transitions. [2019-01-12 04:41:31,120 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 7175 transitions. Word has length 378 [2019-01-12 04:41:31,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:31,120 INFO L480 AbstractCegarLoop]: Abstraction has 6255 states and 7175 transitions. [2019-01-12 04:41:31,120 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 04:41:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 7175 transitions. [2019-01-12 04:41:31,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2019-01-12 04:41:31,130 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:31,130 INFO L402 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, 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, 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, 1] [2019-01-12 04:41:31,131 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:31,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:31,132 INFO L82 PathProgramCache]: Analyzing trace with hash 2096095659, now seen corresponding path program 1 times [2019-01-12 04:41:31,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:31,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:31,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:31,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:31,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:31,536 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:41:31,922 WARN L181 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 16 [2019-01-12 04:41:32,441 WARN L181 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 21 [2019-01-12 04:41:32,714 WARN L181 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 21 [2019-01-12 04:41:32,993 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 32 proven. 10 refuted. 0 times theorem prover too weak. 197 trivial. 0 not checked. [2019-01-12 04:41:32,994 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:41:32,994 INFO L223 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 [2019-01-12 04:41:33,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:33,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:33,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:41:33,535 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2019-01-12 04:41:33,557 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:41:33,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 7 [2019-01-12 04:41:33,559 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 04:41:33,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 04:41:33,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:41:33,560 INFO L87 Difference]: Start difference. First operand 6255 states and 7175 transitions. Second operand 8 states. [2019-01-12 04:41:38,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:38,385 INFO L93 Difference]: Finished difference Result 16807 states and 19044 transitions. [2019-01-12 04:41:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:41:38,386 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 442 [2019-01-12 04:41:38,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:38,411 INFO L225 Difference]: With dead ends: 16807 [2019-01-12 04:41:38,412 INFO L226 Difference]: Without dead ends: 10883 [2019-01-12 04:41:38,421 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 450 GetRequests, 442 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=40, Invalid=50, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:41:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10883 states. [2019-01-12 04:41:38,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10883 to 7900. [2019-01-12 04:41:38,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7900 states. [2019-01-12 04:41:38,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7900 states to 7900 states and 8887 transitions. [2019-01-12 04:41:38,620 INFO L78 Accepts]: Start accepts. Automaton has 7900 states and 8887 transitions. Word has length 442 [2019-01-12 04:41:38,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:38,622 INFO L480 AbstractCegarLoop]: Abstraction has 7900 states and 8887 transitions. [2019-01-12 04:41:38,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 04:41:38,623 INFO L276 IsEmpty]: Start isEmpty. Operand 7900 states and 8887 transitions. [2019-01-12 04:41:38,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2019-01-12 04:41:38,643 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:38,644 INFO L402 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:38,644 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:38,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:38,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1733711371, now seen corresponding path program 1 times [2019-01-12 04:41:38,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:38,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:38,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:38,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:38,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:38,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:39,139 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:41:39,483 WARN L181 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 04:41:39,897 WARN L181 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 15 [2019-01-12 04:41:40,397 WARN L181 SmtUtils]: Spent 398.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 20 [2019-01-12 04:41:40,608 WARN L181 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 31 [2019-01-12 04:41:41,440 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 377 proven. 64 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2019-01-12 04:41:41,440 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:41:41,440 INFO L223 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 [2019-01-12 04:41:41,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:41,572 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:41:41,870 INFO L134 CoverageAnalysis]: Checked inductivity of 485 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2019-01-12 04:41:41,890 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:41:41,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2019-01-12 04:41:41,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:41:41,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:41:41,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:41:41,892 INFO L87 Difference]: Start difference. First operand 7900 states and 8887 transitions. Second operand 9 states. [2019-01-12 04:41:47,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:47,371 INFO L93 Difference]: Finished difference Result 18118 states and 20233 transitions. [2019-01-12 04:41:47,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:41:47,375 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 526 [2019-01-12 04:41:47,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:47,396 INFO L225 Difference]: With dead ends: 18118 [2019-01-12 04:41:47,396 INFO L226 Difference]: Without dead ends: 10549 [2019-01-12 04:41:47,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 525 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2019-01-12 04:41:47,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10549 states. [2019-01-12 04:41:47,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10549 to 8887. [2019-01-12 04:41:47,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8887 states. [2019-01-12 04:41:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9666 transitions. [2019-01-12 04:41:47,543 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9666 transitions. Word has length 526 [2019-01-12 04:41:47,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:47,544 INFO L480 AbstractCegarLoop]: Abstraction has 8887 states and 9666 transitions. [2019-01-12 04:41:47,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:41:47,544 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9666 transitions. [2019-01-12 04:41:47,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 652 [2019-01-12 04:41:47,567 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:47,568 INFO L402 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:47,568 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 9213663, now seen corresponding path program 1 times [2019-01-12 04:41:47,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:47,568 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:47,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:47,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:48,435 INFO L134 CoverageAnalysis]: Checked inductivity of 889 backedges. 721 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-01-12 04:41:48,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:48,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:41:48,438 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:41:48,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:41:48,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:48,439 INFO L87 Difference]: Start difference. First operand 8887 states and 9666 transitions. Second operand 4 states. [2019-01-12 04:41:51,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:51,301 INFO L93 Difference]: Finished difference Result 20733 states and 22587 transitions. [2019-01-12 04:41:51,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:41:51,303 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 651 [2019-01-12 04:41:51,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:51,326 INFO L225 Difference]: With dead ends: 20733 [2019-01-12 04:41:51,327 INFO L226 Difference]: Without dead ends: 11848 [2019-01-12 04:41:51,337 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2019-01-12 04:41:51,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 10861. [2019-01-12 04:41:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10861 states. [2019-01-12 04:41:51,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11575 transitions. [2019-01-12 04:41:51,489 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11575 transitions. Word has length 651 [2019-01-12 04:41:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:51,490 INFO L480 AbstractCegarLoop]: Abstraction has 10861 states and 11575 transitions. [2019-01-12 04:41:51,490 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:41:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11575 transitions. [2019-01-12 04:41:51,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 715 [2019-01-12 04:41:51,517 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:51,518 INFO L402 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, 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, 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, 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] [2019-01-12 04:41:51,518 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:51,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:51,522 INFO L82 PathProgramCache]: Analyzing trace with hash -882569085, now seen corresponding path program 1 times [2019-01-12 04:41:51,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:51,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:51,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:51,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:51,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:52,040 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 791 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2019-01-12 04:41:52,040 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:52,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:41:52,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:41:52,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:41:52,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:52,042 INFO L87 Difference]: Start difference. First operand 10861 states and 11575 transitions. Second operand 4 states. [2019-01-12 04:41:53,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:53,991 INFO L93 Difference]: Finished difference Result 25010 states and 26755 transitions. [2019-01-12 04:41:53,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:41:53,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 714 [2019-01-12 04:41:53,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:54,015 INFO L225 Difference]: With dead ends: 25010 [2019-01-12 04:41:54,015 INFO L226 Difference]: Without dead ends: 14151 [2019-01-12 04:41:54,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2019-01-12 04:41:54,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13822. [2019-01-12 04:41:54,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13822 states. [2019-01-12 04:41:54,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14621 transitions. [2019-01-12 04:41:54,232 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14621 transitions. Word has length 714 [2019-01-12 04:41:54,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:54,234 INFO L480 AbstractCegarLoop]: Abstraction has 13822 states and 14621 transitions. [2019-01-12 04:41:54,234 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:41:54,234 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14621 transitions. [2019-01-12 04:41:54,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 860 [2019-01-12 04:41:54,274 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:54,276 INFO L402 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:41:54,276 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:54,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:54,278 INFO L82 PathProgramCache]: Analyzing trace with hash 1021798831, now seen corresponding path program 1 times [2019-01-12 04:41:54,278 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:54,279 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:54,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:54,282 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:54,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:54,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:55,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1199 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 623 trivial. 0 not checked. [2019-01-12 04:41:55,208 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:55,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:41:55,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:41:55,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:41:55,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:55,210 INFO L87 Difference]: Start difference. First operand 13822 states and 14621 transitions. Second operand 4 states. [2019-01-12 04:41:57,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:41:57,120 INFO L93 Difference]: Finished difference Result 30603 states and 32276 transitions. [2019-01-12 04:41:57,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:41:57,121 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 859 [2019-01-12 04:41:57,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:41:57,136 INFO L225 Difference]: With dead ends: 30603 [2019-01-12 04:41:57,136 INFO L226 Difference]: Without dead ends: 15138 [2019-01-12 04:41:57,147 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:41:57,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2019-01-12 04:41:57,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 12506. [2019-01-12 04:41:57,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12506 states. [2019-01-12 04:41:57,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12973 transitions. [2019-01-12 04:41:57,317 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12973 transitions. Word has length 859 [2019-01-12 04:41:57,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:41:57,319 INFO L480 AbstractCegarLoop]: Abstraction has 12506 states and 12973 transitions. [2019-01-12 04:41:57,319 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:41:57,319 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12973 transitions. [2019-01-12 04:41:57,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1062 [2019-01-12 04:41:57,347 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:41:57,349 INFO L402 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, 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, 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:41:57,349 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:41:57,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:41:57,350 INFO L82 PathProgramCache]: Analyzing trace with hash 2072575219, now seen corresponding path program 1 times [2019-01-12 04:41:57,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:41:57,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:41:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:57,354 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:41:57,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:41:57,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:41:58,105 WARN L181 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:41:58,378 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-01-12 04:41:58,746 WARN L181 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 12 [2019-01-12 04:41:59,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1787 backedges. 1120 proven. 0 refuted. 0 times theorem prover too weak. 667 trivial. 0 not checked. [2019-01-12 04:41:59,949 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:41:59,949 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 04:41:59,950 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:41:59,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:41:59,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:41:59,952 INFO L87 Difference]: Start difference. First operand 12506 states and 12973 transitions. Second operand 6 states. [2019-01-12 04:42:02,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:02,400 INFO L93 Difference]: Finished difference Result 25677 states and 26629 transitions. [2019-01-12 04:42:02,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 04:42:02,402 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1061 [2019-01-12 04:42:02,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:02,427 INFO L225 Difference]: With dead ends: 25677 [2019-01-12 04:42:02,428 INFO L226 Difference]: Without dead ends: 13173 [2019-01-12 04:42:02,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-01-12 04:42:02,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13173 states. [2019-01-12 04:42:02,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13173 to 12835. [2019-01-12 04:42:02,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-01-12 04:42:02,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13308 transitions. [2019-01-12 04:42:02,632 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13308 transitions. Word has length 1061 [2019-01-12 04:42:02,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:02,634 INFO L480 AbstractCegarLoop]: Abstraction has 12835 states and 13308 transitions. [2019-01-12 04:42:02,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:42:02,634 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13308 transitions. [2019-01-12 04:42:02,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2019-01-12 04:42:02,666 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:02,667 INFO L402 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, 7, 7, 7, 7, 7, 7, 7, 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, 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:42:02,667 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:02,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1189912824, now seen corresponding path program 1 times [2019-01-12 04:42:02,669 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:02,669 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:02,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:02,670 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:02,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:03,482 WARN L181 SmtUtils]: Spent 116.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 04:42:03,803 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2019-01-12 04:42:06,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3044 backedges. 1564 proven. 242 refuted. 0 times theorem prover too weak. 1238 trivial. 0 not checked. [2019-01-12 04:42:06,047 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:42:06,047 INFO L223 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 [2019-01-12 04:42:06,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:06,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:06,340 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:42:07,025 WARN L181 SmtUtils]: Spent 423.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 15 [2019-01-12 04:42:08,166 INFO L134 CoverageAnalysis]: Checked inductivity of 3044 backedges. 2250 proven. 28 refuted. 0 times theorem prover too weak. 766 trivial. 0 not checked. [2019-01-12 04:42:08,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:42:08,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 11 [2019-01-12 04:42:08,186 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 04:42:08,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 04:42:08,187 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:42:08,187 INFO L87 Difference]: Start difference. First operand 12835 states and 13308 transitions. Second operand 11 states. [2019-01-12 04:42:11,745 WARN L181 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 16 [2019-01-12 04:42:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:19,274 INFO L93 Difference]: Finished difference Result 27975 states and 28972 transitions. [2019-01-12 04:42:19,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 04:42:19,275 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 1277 [2019-01-12 04:42:19,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:19,290 INFO L225 Difference]: With dead ends: 27975 [2019-01-12 04:42:19,290 INFO L226 Difference]: Without dead ends: 14813 [2019-01-12 04:42:19,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1300 GetRequests, 1281 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-01-12 04:42:19,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14813 states. [2019-01-12 04:42:19,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14813 to 12835. [2019-01-12 04:42:19,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12835 states. [2019-01-12 04:42:19,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13235 transitions. [2019-01-12 04:42:19,455 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13235 transitions. Word has length 1277 [2019-01-12 04:42:19,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:19,455 INFO L480 AbstractCegarLoop]: Abstraction has 12835 states and 13235 transitions. [2019-01-12 04:42:19,455 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 04:42:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13235 transitions. [2019-01-12 04:42:19,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1812 [2019-01-12 04:42:19,514 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:19,516 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 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, 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, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 04:42:19,517 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:19,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:19,518 INFO L82 PathProgramCache]: Analyzing trace with hash -2113317781, now seen corresponding path program 1 times [2019-01-12 04:42:19,518 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:19,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:19,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:19,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:19,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:20,398 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 9 [2019-01-12 04:42:20,708 WARN L181 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2019-01-12 04:42:21,068 WARN L181 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 11 [2019-01-12 04:42:23,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2368 proven. 157 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-12 04:42:23,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:42:23,446 INFO L223 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 [2019-01-12 04:42:23,459 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:23,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:23,854 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:42:26,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 2525 proven. 0 refuted. 0 times theorem prover too weak. 3655 trivial. 0 not checked. [2019-01-12 04:42:26,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:42:26,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2019-01-12 04:42:26,149 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:42:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:42:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:42:26,150 INFO L87 Difference]: Start difference. First operand 12835 states and 13235 transitions. Second operand 9 states. [2019-01-12 04:42:32,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:32,947 INFO L93 Difference]: Finished difference Result 35012 states and 36137 transitions. [2019-01-12 04:42:32,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-01-12 04:42:32,948 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1811 [2019-01-12 04:42:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:32,966 INFO L225 Difference]: With dead ends: 35012 [2019-01-12 04:42:32,966 INFO L226 Difference]: Without dead ends: 22508 [2019-01-12 04:42:32,976 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1837 GetRequests, 1819 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2019-01-12 04:42:32,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22508 states. [2019-01-12 04:42:33,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22508 to 18428. [2019-01-12 04:42:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18428 states. [2019-01-12 04:42:33,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18980 transitions. [2019-01-12 04:42:33,172 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18980 transitions. Word has length 1811 [2019-01-12 04:42:33,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:33,173 INFO L480 AbstractCegarLoop]: Abstraction has 18428 states and 18980 transitions. [2019-01-12 04:42:33,173 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:42:33,173 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18980 transitions. [2019-01-12 04:42:33,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1873 [2019-01-12 04:42:33,209 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:33,210 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 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, 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, 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, 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, 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] [2019-01-12 04:42:33,210 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:33,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:33,211 INFO L82 PathProgramCache]: Analyzing trace with hash -967917091, now seen corresponding path program 1 times [2019-01-12 04:42:33,211 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:33,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:33,213 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:33,213 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:33,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:34,680 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 04:42:37,649 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 4660 proven. 445 refuted. 0 times theorem prover too weak. 1375 trivial. 0 not checked. [2019-01-12 04:42:37,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:42:37,650 INFO L223 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 [2019-01-12 04:42:37,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:38,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:38,131 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:42:39,970 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 3595 proven. 0 refuted. 0 times theorem prover too weak. 2885 trivial. 0 not checked. [2019-01-12 04:42:39,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:42:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2019-01-12 04:42:39,993 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 04:42:39,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 04:42:39,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:42:39,994 INFO L87 Difference]: Start difference. First operand 18428 states and 18980 transitions. Second operand 10 states. [2019-01-12 04:42:47,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:42:47,473 INFO L93 Difference]: Finished difference Result 37974 states and 39113 transitions. [2019-01-12 04:42:47,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-01-12 04:42:47,474 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 1872 [2019-01-12 04:42:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:42:47,496 INFO L225 Difference]: With dead ends: 37974 [2019-01-12 04:42:47,496 INFO L226 Difference]: Without dead ends: 18223 [2019-01-12 04:42:47,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1903 GetRequests, 1882 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=157, Invalid=305, Unknown=0, NotChecked=0, Total=462 [2019-01-12 04:42:47,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18223 states. [2019-01-12 04:42:47,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18223 to 17770. [2019-01-12 04:42:47,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17770 states. [2019-01-12 04:42:47,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17770 states to 17770 states and 18267 transitions. [2019-01-12 04:42:47,704 INFO L78 Accepts]: Start accepts. Automaton has 17770 states and 18267 transitions. Word has length 1872 [2019-01-12 04:42:47,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:42:47,705 INFO L480 AbstractCegarLoop]: Abstraction has 17770 states and 18267 transitions. [2019-01-12 04:42:47,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 04:42:47,705 INFO L276 IsEmpty]: Start isEmpty. Operand 17770 states and 18267 transitions. [2019-01-12 04:42:47,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2034 [2019-01-12 04:42:47,733 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:42:47,734 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 7, 7, 7, 7, 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, 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, 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, 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] [2019-01-12 04:42:47,734 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:42:47,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:42:47,735 INFO L82 PathProgramCache]: Analyzing trace with hash 2012637863, now seen corresponding path program 1 times [2019-01-12 04:42:47,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:42:47,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:42:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:47,738 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:47,738 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:42:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:50,998 INFO L134 CoverageAnalysis]: Checked inductivity of 7858 backedges. 5053 proven. 341 refuted. 0 times theorem prover too weak. 2464 trivial. 0 not checked. [2019-01-12 04:42:50,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:42:50,999 INFO L223 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 [2019-01-12 04:42:51,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:42:51,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:42:51,486 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:42:53,196 INFO L134 CoverageAnalysis]: Checked inductivity of 7858 backedges. 4372 proven. 0 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2019-01-12 04:42:53,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:42:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2019-01-12 04:42:53,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:42:53,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:42:53,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:42:53,222 INFO L87 Difference]: Start difference. First operand 17770 states and 18267 transitions. Second operand 9 states. [2019-01-12 04:43:00,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:43:00,842 INFO L93 Difference]: Finished difference Result 36523 states and 37532 transitions. [2019-01-12 04:43:00,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:43:00,843 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 2033 [2019-01-12 04:43:00,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:43:00,845 INFO L225 Difference]: With dead ends: 36523 [2019-01-12 04:43:00,845 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:43:00,856 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2052 GetRequests, 2036 SyntacticMatches, 8 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2019-01-12 04:43:00,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:43:00,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:43:00,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:43:00,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:43:00,857 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2033 [2019-01-12 04:43:00,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:43:00,857 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:43:00,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:43:00,857 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:43:00,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:43:00,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:43:01,094 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,696 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,713 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,768 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,781 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,795 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,809 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:01,926 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,249 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,359 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,389 WARN L181 SmtUtils]: Spent 1.52 s on a formula simplification. DAG size of input: 545 DAG size of output: 395 [2019-01-12 04:43:02,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,567 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,572 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,581 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,601 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,610 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,613 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,640 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,665 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,672 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,694 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:02,710 WARN L181 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 290 DAG size of output: 212 [2019-01-12 04:43:02,881 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,225 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,287 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,310 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,321 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,354 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,415 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,660 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,683 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,749 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:43:03,772 WARN L181 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 548 DAG size of output: 390 [2019-01-12 04:43:06,259 WARN L181 SmtUtils]: Spent 2.48 s on a formula simplification. DAG size of input: 375 DAG size of output: 65 [2019-01-12 04:43:07,229 WARN L181 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 201 DAG size of output: 64 [2019-01-12 04:43:09,550 WARN L181 SmtUtils]: Spent 2.32 s on a formula simplification. DAG size of input: 370 DAG size of output: 65 [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L894(lines 894 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L828(lines 828 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L696(lines 696 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L1687(lines 1687 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L1291(lines 1291 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,554 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L961(lines 961 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L763(lines 763 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L631(lines 631 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L1622(lines 1622 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L1358(lines 1358 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L235(lines 235 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L1160(lines 1160 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:43:09,555 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:43:09,556 INFO L444 ceAbstractionStarter]: At program point L1491(lines 23 1492) the Hoare annotation is: (let ((.cse6 (= ~a16~0 9)) (.cse12 (= ~a12~0 7))) (let ((.cse0 (= ~a16~0 8)) (.cse4 (not .cse12)) (.cse5 (not (= 8 ~a12~0))) (.cse9 (<= (+ ~a18~0 79) 0)) (.cse8 (<= ~a16~0 11)) (.cse10 (not .cse6)) (.cse11 (= ~a12~0 6)) (.cse2 (<= ~a18~0 134)) (.cse3 (= ~a15~0 3)) (.cse7 (< 0 (+ ~a18~0 156))) (.cse1 (= ~a15~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (not .cse0) .cse3 (<= ~a16~0 9) (< 134 ~a18~0)) (and .cse1 .cse0 .cse5 .cse4) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse6 .cse2 (= ~a12~0 8) .cse7) (and (not (= ~a16~0 10)) (and .cse8 (and .cse9 .cse3))) (and .cse1 .cse8 .cse10 (= ~a12~0 5)) (and .cse1 .cse2 (and .cse8 .cse11)) (and .cse1 (<= (+ ~a18~0 87) 0) .cse6 .cse7) (and .cse6 (and .cse1 .cse5 .cse9)) (and .cse1 .cse8 .cse10 .cse11) (and (<= 11 ~a16~0) .cse2 .cse3 .cse7) (and .cse1 .cse6 .cse12)))) [2019-01-12 04:43:09,556 INFO L448 ceAbstractionStarter]: For program point L434(lines 434 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,556 INFO L448 ceAbstractionStarter]: For program point L1227(lines 1227 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,556 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L567(lines 567 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L501(lines 501 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L1757(lines 1757 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L1097(lines 1097 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,557 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L1031(lines 1031 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L899(lines 899 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L1428(lines 1428 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L834(lines 834 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L1693(lines 1693 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L636(lines 636 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L1297(lines 1297 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L240(lines 240 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,558 INFO L448 ceAbstractionStarter]: For program point L967(lines 967 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L769(lines 769 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L703(lines 703 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L1628(lines 1628 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L1364(lines 1364 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L1166(lines 1166 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L1497(lines 1497 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,559 INFO L448 ceAbstractionStarter]: For program point L440(lines 440 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L573(lines 573 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L1234(lines 1234 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L1036(lines 1036 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L706(lines 706 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L508(lines 508 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:43:09,560 INFO L448 ceAbstractionStarter]: For program point L1103(lines 1103 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L905(lines 905 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L444 ceAbstractionStarter]: At program point L1764(lines 1494 1765) the Hoare annotation is: (let ((.cse4 (= ~a12~0 7)) (.cse3 (= ~a16~0 9))) (let ((.cse0 (= ~a16~0 8)) (.cse5 (not (= 8 ~a12~0))) (.cse8 (not .cse3)) (.cse6 (not .cse4)) (.cse12 (< 0 (+ ~a18~0 156))) (.cse11 (<= (+ ~a18~0 79) 0)) (.cse10 (= ~a15~0 3)) (.cse2 (<= ~a18~0 134)) (.cse1 (= ~a15~0 4)) (.cse7 (<= ~a16~0 11)) (.cse9 (= ~a12~0 6))) (or (and .cse0 .cse1 .cse2) (and .cse1 .cse3 .cse4) (and .cse0 .cse1 .cse5 .cse6) (and .cse1 .cse7 .cse8 .cse9) (and (not .cse0) .cse10 (<= ~a16~0 9) (< 134 ~a18~0)) (and .cse1 .cse11 .cse3 .cse5) (and .cse1 .cse7 .cse8 (= ~a12~0 5)) (and .cse10 .cse6) (and .cse1 (<= (+ ~a18~0 87) 0) .cse3 .cse12) (and (<= 11 ~a16~0) .cse10 .cse2 .cse12) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse3 .cse2 (= ~a12~0 8) .cse12) (and (not (= ~a16~0 10)) (and .cse7 (and .cse11 .cse10))) (and .cse2 (and .cse1 .cse7) .cse9)))) [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L443(lines 443 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L1434(lines 1434 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,561 INFO L448 ceAbstractionStarter]: For program point L1699(lines 1699 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L1633(lines 1633 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L1303(lines 1303 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L246(lines 246 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L775(lines 775 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L1370(lines 1370 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,562 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L974(lines 974 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L451 ceAbstractionStarter]: At program point L1767(lines 1767 1783) the Hoare annotation is: true [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L578(lines 578 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L1503(lines 1503 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,563 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1042(lines 1042 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L778(lines 778 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1241(lines 1241 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1175(lines 1175 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1109(lines 1109 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1704(lines 1704 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L1638(lines 1638 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,564 INFO L448 ceAbstractionStarter]: For program point L515(lines 515 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L1440(lines 1440 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L846(lines 846 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L648(lines 648 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L1573(lines 1573 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L1375(lines 1375 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L1309(lines 1309 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L252(lines 252 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,565 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L444 ceAbstractionStarter]: At program point L1773-2(lines 1773 1782) the Hoare annotation is: (let ((.cse6 (= ~a16~0 9)) (.cse12 (= ~a12~0 7))) (let ((.cse0 (= ~a16~0 8)) (.cse4 (not .cse12)) (.cse5 (not (= 8 ~a12~0))) (.cse9 (<= (+ ~a18~0 79) 0)) (.cse8 (<= ~a16~0 11)) (.cse10 (not .cse6)) (.cse11 (= ~a12~0 6)) (.cse2 (<= ~a18~0 134)) (.cse3 (= ~a15~0 3)) (.cse7 (< 0 (+ ~a18~0 156))) (.cse1 (= ~a15~0 4))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4) (and (not .cse0) .cse3 (<= ~a16~0 9) (< 134 ~a18~0)) (and .cse1 .cse0 .cse5 .cse4) (and .cse1 (not (= 3 ULTIMATE.start_calculate_output_~input)) .cse6 .cse2 (= ~a12~0 8) .cse7) (and (not (= ~a16~0 10)) (and .cse8 (and .cse9 .cse3))) (and .cse1 .cse8 .cse10 (= ~a12~0 5)) (and .cse1 .cse2 (and .cse8 .cse11)) (and .cse1 (<= (+ ~a18~0 87) 0) .cse6 .cse7) (and .cse6 (and .cse1 .cse5 .cse9)) (and .cse1 .cse8 .cse10 .cse11) (and (<= 11 ~a16~0) .cse2 .cse3 .cse7) (and .cse1 .cse6 .cse12)))) [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L584(lines 584 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,566 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L717(lines 717 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L1510(lines 1510 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L321(lines 321 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L1114(lines 1114 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L1048(lines 1048 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L784(lines 784 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,567 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L1247(lines 1247 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L1181(lines 1181 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L917(lines 917 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L1446(lines 1446 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L1314(lines 1314 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,568 INFO L448 ceAbstractionStarter]: For program point L257(lines 257 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L1645(lines 1645 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L1579(lines 1579 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L1381(lines 1381 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L1778(line 1778) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L655(lines 655 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L589(lines 589 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L457(lines 457 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L1250(lines 1250 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,569 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L986(lines 986 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L1515(lines 1515 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L789(lines 789 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L723(lines 723 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L1120(lines 1120 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,570 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L922(lines 922 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L1715(lines 1715 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L1187(lines 1187 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L1055(lines 1055 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L857(lines 857 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L1386(lines 1386 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:43:09,571 INFO L448 ceAbstractionStarter]: For program point L1651(lines 1651 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L1585(lines 1585 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L661(lines 661 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L463(lines 463 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L1256(lines 1256 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:43:09,572 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L728(lines 728 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L1521(lines 1521 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L1125(lines 1125 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L993(lines 993 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L796(lines 796 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,573 INFO L448 ceAbstractionStarter]: For program point L1721(lines 1721 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L664(lines 664 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L1193(lines 1193 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L1061(lines 1061 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L929(lines 929 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L863(lines 863 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L1656(lines 1656 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L533(lines 533 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,574 INFO L448 ceAbstractionStarter]: For program point L1392(lines 1392 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L600(lines 600 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L1591(lines 1591 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L1327(lines 1327 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L469(lines 469 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L1262(lines 1262 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L734(lines 734 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,575 INFO L448 ceAbstractionStarter]: For program point L1527(lines 1527 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L1131(lines 1131 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L999(lines 999 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L802(lines 802 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L1727(lines 1727 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,576 INFO L448 ceAbstractionStarter]: For program point L670(lines 670 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L538(lines 538 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L1397(lines 1397 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L274(lines 274 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L1067(lines 1067 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L869(lines 869 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L1200(lines 1200 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L1663(lines 1663 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,577 INFO L448 ceAbstractionStarter]: For program point L1597(lines 1597 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L1267(lines 1267 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L1334(lines 1334 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L1137(lines 1137 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L1005(lines 1005 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,578 INFO L448 ceAbstractionStarter]: For program point L741(lines 741 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L543(lines 543 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L1534(lines 1534 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L411(lines 411 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L279(lines 279 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L213(lines 213 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L808(lines 808 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L1733(lines 1733 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L1403(lines 1403 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,579 INFO L448 ceAbstractionStarter]: For program point L1205(lines 1205 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L1073(lines 1073 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L875(lines 875 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L677(lines 677 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L1669(lines 1669 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L612(lines 612 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L1603(lines 1603 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,580 INFO L448 ceAbstractionStarter]: For program point L1472(lines 1472 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L1274(lines 1274 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L746(lines 746 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L680(lines 680 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L1341(lines 1341 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L1143(lines 1143 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,581 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L483(lines 483 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L417(lines 417 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L1739(lines 1739 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L1409(lines 1409 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L1211(lines 1211 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:43:09,582 INFO L448 ceAbstractionStarter]: For program point L1079(lines 1079 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L815(lines 815 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L882(lines 882 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L1675(lines 1675 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L618(lines 618 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L1609(lines 1609 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L1477(lines 1477 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,583 INFO L448 ceAbstractionStarter]: For program point L1280(lines 1280 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L1214(lines 1214 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L752(lines 752 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L686(lines 686 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L356(lines 356 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L1347(lines 1347 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L290(lines 290 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,584 INFO L448 ceAbstractionStarter]: For program point L1149(lines 1149 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L1546(lines 1546 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L489(lines 489 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L1018(lines 1018 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L424(lines 424 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L1415(lines 1415 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:43:09,585 INFO L448 ceAbstractionStarter]: For program point L1746(lines 1746 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L954(lines 954 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L888(lines 888 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L822(lines 822 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L624(lines 624 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L691(lines 691 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L1682(lines 1682 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,586 INFO L448 ceAbstractionStarter]: For program point L1616(lines 1616 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L1484(lines 1484 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L427(lines 427 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L1286(lines 1286 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L1220(lines 1220 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L758(lines 758 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,587 INFO L448 ceAbstractionStarter]: For program point L560(lines 560 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L1353(lines 1353 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L1155(lines 1155 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L495(lines 495 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1492) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L1553(lines 1553 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:43:09,588 INFO L448 ceAbstractionStarter]: For program point L1025(lines 1025 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,589 INFO L448 ceAbstractionStarter]: For program point L1752(lines 1752 1763) no Hoare annotation was computed. [2019-01-12 04:43:09,589 INFO L448 ceAbstractionStarter]: For program point L1422(lines 1422 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,589 INFO L448 ceAbstractionStarter]: For program point L1092(lines 1092 1490) no Hoare annotation was computed. [2019-01-12 04:43:09,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:43:09 BoogieIcfgContainer [2019-01-12 04:43:09,637 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:43:09,637 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:43:09,637 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:43:09,637 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:43:09,638 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:40:59" (3/4) ... [2019-01-12 04:43:09,655 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:43:09,722 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:43:09,730 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:43:10,087 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:43:10,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:43:10,089 INFO L168 Benchmark]: Toolchain (without parser) took 137923.02 ms. Allocated memory was 1.0 GB in the beginning and 5.0 GB in the end (delta: 4.0 GB). Free memory was 940.6 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 656.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,090 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:43:10,090 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1461.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,090 INFO L168 Benchmark]: Boogie Procedure Inliner took 216.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,090 INFO L168 Benchmark]: Boogie Preprocessor took 180.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,091 INFO L168 Benchmark]: RCFGBuilder took 5942.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 852.2 MB in the end (delta: 262.5 MB). Peak memory consumption was 262.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,091 INFO L168 Benchmark]: TraceAbstraction took 129665.88 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 852.2 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2019-01-12 04:43:10,091 INFO L168 Benchmark]: Witness Printer took 450.38 ms. Allocated memory is still 5.0 GB. Free memory is still 4.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 04:43:10,094 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 1461.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 940.6 MB in the beginning and 1.2 GB in the end (delta: -211.4 MB). Peak memory consumption was 105.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 216.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.0 MB). Peak memory consumption was 26.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 180.34 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.2 MB). Peak memory consumption was 11.2 MB. Max. memory is 11.5 GB. * RCFGBuilder took 5942.83 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 852.2 MB in the end (delta: 262.5 MB). Peak memory consumption was 262.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 129665.88 ms. Allocated memory was 1.2 GB in the beginning and 5.0 GB in the end (delta: 3.8 GB). Free memory was 852.2 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. * Witness Printer took 450.38 ms. Allocated memory is still 5.0 GB. Free memory is still 4.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: 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: 23]: Loop Invariant Derived loop invariant: (((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || (a15 == 3 && !(a12 == 7))) || (((!(a16 == 8) && a15 == 3) && a16 <= 9) && 134 < a18)) || (((a15 == 4 && a16 == 8) && !(8 == a12)) && !(a12 == 7))) || (((((a15 == 4 && !(3 == input)) && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || (!(a16 == 10) && a16 <= 11 && a18 + 79 <= 0 && a15 == 3)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 5)) || ((a15 == 4 && a18 <= 134) && a16 <= 11 && a12 == 6)) || (((a15 == 4 && a18 + 87 <= 0) && a16 == 9) && 0 < a18 + 156)) || (a16 == 9 && (a15 == 4 && !(8 == a12)) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 6)) || (((11 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((a15 == 4 && a16 == 9) && a12 == 7) - InvariantResult [Line: 1494]: Loop Invariant Derived loop invariant: (((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || ((a15 == 4 && a16 == 9) && a12 == 7)) || (((a16 == 8 && a15 == 4) && !(8 == a12)) && !(a12 == 7))) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 6)) || (((!(a16 == 8) && a15 == 3) && a16 <= 9) && 134 < a18)) || (((a15 == 4 && a18 + 79 <= 0) && a16 == 9) && !(8 == a12))) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 5)) || (a15 == 3 && !(a12 == 7))) || (((a15 == 4 && a18 + 87 <= 0) && a16 == 9) && 0 < a18 + 156)) || (((11 <= a16 && a15 == 3) && a18 <= 134) && 0 < a18 + 156)) || (((((a15 == 4 && !(3 == input)) && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || (!(a16 == 10) && a16 <= 11 && a18 + 79 <= 0 && a15 == 3)) || ((a18 <= 134 && a15 == 4 && a16 <= 11) && a12 == 6) - InvariantResult [Line: 1767]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1773]: Loop Invariant Derived loop invariant: (((((((((((((a16 == 8 && a15 == 4) && a18 <= 134) || (a15 == 3 && !(a12 == 7))) || (((!(a16 == 8) && a15 == 3) && a16 <= 9) && 134 < a18)) || (((a15 == 4 && a16 == 8) && !(8 == a12)) && !(a12 == 7))) || (((((a15 == 4 && !(3 == input)) && a16 == 9) && a18 <= 134) && a12 == 8) && 0 < a18 + 156)) || (!(a16 == 10) && a16 <= 11 && a18 + 79 <= 0 && a15 == 3)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 5)) || ((a15 == 4 && a18 <= 134) && a16 <= 11 && a12 == 6)) || (((a15 == 4 && a18 + 87 <= 0) && a16 == 9) && 0 < a18 + 156)) || (a16 == 9 && (a15 == 4 && !(8 == a12)) && a18 + 79 <= 0)) || (((a15 == 4 && a16 <= 11) && !(a16 == 9)) && a12 == 6)) || (((11 <= a16 && a18 <= 134) && a15 == 3) && 0 < a18 + 156)) || ((a15 == 4 && a16 == 9) && a12 == 7) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. SAFE Result, 129.5s OverallTime, 16 OverallIterations, 12 TraceHistogramMax, 79.2s AutomataDifference, 0.0s DeadEndRemovalTime, 8.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 2268 SDtfs, 21649 SDslu, 710 SDs, 0 SdLazy, 55753 SolverSat, 4676 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 64.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 8131 GetRequests, 8003 SyntacticMatches, 16 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 11.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18428occurred in iteration=14, 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: 2.2s AutomataMinimizationTime, 16 MinimizatonAttempts, 17489 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 233 NumberOfFragments, 567 HoareAnnotationTreeSize, 4 FomulaSimplifications, 335964 FormulaSimplificationTreeSizeReduction, 2.9s HoareSimplificationTime, 4 FomulaSimplificationsInter, 50019 FormulaSimplificationTreeSizeReductionInter, 5.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.6s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 20430 NumberOfCodeBlocks, 20430 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 20408 ConstructedInterpolants, 0 QuantifiedInterpolants, 83198233 SizeOfPredicates, 2 NumberOfNonLiveVariables, 9236 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 22 InterpolantComputations, 15 PerfectInterpolantSequences, 52834/54121 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...