./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.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/Problem01_label30_true-unreach-call_false-termination.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 cc1563f4697cf21aca476a1aac04fcd8ee81163f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 00:53:02,171 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:53:02,173 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:53:02,193 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:53:02,194 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:53:02,196 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:53:02,198 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:53:02,200 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:53:02,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:53:02,206 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:53:02,208 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:53:02,209 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:53:02,210 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:53:02,213 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:53:02,220 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:53:02,224 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:53:02,225 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:53:02,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:53:02,231 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:53:02,235 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:53:02,238 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:53:02,241 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:53:02,247 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:53:02,248 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:53:02,248 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:53:02,249 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:53:02,250 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:53:02,252 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:53:02,253 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:53:02,256 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:53:02,256 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:53:02,258 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:53:02,259 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:53:02,259 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:53:02,260 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:53:02,262 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:53:02,263 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:53:02,288 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:53:02,289 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:53:02,291 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:53:02,291 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:53:02,292 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:53:02,292 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:53:02,292 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:53:02,293 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:53:02,293 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:53:02,293 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:53:02,293 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:53:02,294 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:53:02,294 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:53:02,294 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:53:02,294 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:53:02,295 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:53:02,295 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:53:02,295 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:53:02,296 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:53:02,296 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:53:02,296 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:53:02,296 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:53:02,296 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:53:02,296 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:53:02,299 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:53:02,299 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:53:02,300 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:53:02,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:53:02,300 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 -> cc1563f4697cf21aca476a1aac04fcd8ee81163f [2019-01-12 00:53:02,373 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:53:02,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:53:02,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:53:02,397 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:53:02,398 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:53:02,398 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2019-01-12 00:53:02,453 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bab95289/1074d29af791406395c8fe8c843ab35b/FLAG77cbb26ba [2019-01-12 00:53:03,062 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:53:03,063 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label30_true-unreach-call_false-termination.c [2019-01-12 00:53:03,076 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bab95289/1074d29af791406395c8fe8c843ab35b/FLAG77cbb26ba [2019-01-12 00:53:03,274 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0bab95289/1074d29af791406395c8fe8c843ab35b [2019-01-12 00:53:03,279 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:53:03,281 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:53:03,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:03,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:53:03,288 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:53:03,289 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:03" (1/1) ... [2019-01-12 00:53:03,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f8b7262 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:03, skipping insertion in model container [2019-01-12 00:53:03,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:53:03" (1/1) ... [2019-01-12 00:53:03,302 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:53:03,353 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:53:03,817 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:03,828 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:53:03,995 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:53:04,016 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:53:04,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04 WrapperNode [2019-01-12 00:53:04,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:53:04,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:04,023 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:53:04,023 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:53:04,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,154 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:53:04,220 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:53:04,220 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:53:04,220 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:53:04,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,251 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,252 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,291 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,303 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,312 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (1/1) ... [2019-01-12 00:53:04,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:53:04,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:53:04,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:53:04,327 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:53:04,330 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (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 00:53:04,415 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:53:04,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:53:07,645 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:53:07,646 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:53:07,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:07 BoogieIcfgContainer [2019-01-12 00:53:07,648 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:53:07,649 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:53:07,649 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:53:07,652 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:53:07,652 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:53:03" (1/3) ... [2019-01-12 00:53:07,653 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:07, skipping insertion in model container [2019-01-12 00:53:07,653 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:53:04" (2/3) ... [2019-01-12 00:53:07,654 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48d361fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:53:07, skipping insertion in model container [2019-01-12 00:53:07,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:07" (3/3) ... [2019-01-12 00:53:07,656 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label30_true-unreach-call_false-termination.c [2019-01-12 00:53:07,667 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:53:07,676 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:53:07,693 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:53:07,725 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:53:07,726 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:53:07,726 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:53:07,726 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:53:07,727 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:53:07,727 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:53:07,727 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:53:07,727 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:53:07,727 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:53:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:53:07,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2019-01-12 00:53:07,773 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:07,777 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:07,783 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:07,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:07,790 INFO L82 PathProgramCache]: Analyzing trace with hash -1318724346, now seen corresponding path program 1 times [2019-01-12 00:53:07,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:07,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:07,841 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:07,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:08,300 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 00:53:08,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:08,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:08,309 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:08,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:08,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:08,330 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 3 states. [2019-01-12 00:53:09,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:09,917 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions. [2019-01-12 00:53:09,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:09,919 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 125 [2019-01-12 00:53:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:09,936 INFO L225 Difference]: With dead ends: 528 [2019-01-12 00:53:09,936 INFO L226 Difference]: Without dead ends: 266 [2019-01-12 00:53:09,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:09,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2019-01-12 00:53:10,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2019-01-12 00:53:10,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:53:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 374 transitions. [2019-01-12 00:53:10,005 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 374 transitions. Word has length 125 [2019-01-12 00:53:10,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:10,007 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 374 transitions. [2019-01-12 00:53:10,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:10,007 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 374 transitions. [2019-01-12 00:53:10,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-01-12 00:53:10,012 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:10,013 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:53:10,013 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:10,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:10,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1866428878, now seen corresponding path program 1 times [2019-01-12 00:53:10,015 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:10,015 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:10,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:10,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:10,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:10,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:10,218 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:53:10,219 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:10,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:10,221 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:10,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:10,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:10,222 INFO L87 Difference]: Start difference. First operand 266 states and 374 transitions. Second operand 3 states. [2019-01-12 00:53:11,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:11,075 INFO L93 Difference]: Finished difference Result 792 states and 1117 transitions. [2019-01-12 00:53:11,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:11,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 129 [2019-01-12 00:53:11,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:11,083 INFO L225 Difference]: With dead ends: 792 [2019-01-12 00:53:11,083 INFO L226 Difference]: Without dead ends: 528 [2019-01-12 00:53:11,086 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:11,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2019-01-12 00:53:11,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2019-01-12 00:53:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2019-01-12 00:53:11,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 708 transitions. [2019-01-12 00:53:11,123 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 708 transitions. Word has length 129 [2019-01-12 00:53:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:11,123 INFO L480 AbstractCegarLoop]: Abstraction has 528 states and 708 transitions. [2019-01-12 00:53:11,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:11,124 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 708 transitions. [2019-01-12 00:53:11,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-01-12 00:53:11,129 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:11,129 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-01-12 00:53:11,129 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1624585415, now seen corresponding path program 1 times [2019-01-12 00:53:11,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:11,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:11,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:11,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:11,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:11,257 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:53:11,257 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:11,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:11,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:11,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:11,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:11,260 INFO L87 Difference]: Start difference. First operand 528 states and 708 transitions. Second operand 3 states. [2019-01-12 00:53:12,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:12,027 INFO L93 Difference]: Finished difference Result 1316 states and 1785 transitions. [2019-01-12 00:53:12,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:12,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-01-12 00:53:12,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:12,032 INFO L225 Difference]: With dead ends: 1316 [2019-01-12 00:53:12,032 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:53:12,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:12,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:53:12,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 659. [2019-01-12 00:53:12,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-01-12 00:53:12,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 888 transitions. [2019-01-12 00:53:12,075 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 888 transitions. Word has length 148 [2019-01-12 00:53:12,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:12,075 INFO L480 AbstractCegarLoop]: Abstraction has 659 states and 888 transitions. [2019-01-12 00:53:12,075 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:12,075 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 888 transitions. [2019-01-12 00:53:12,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-01-12 00:53:12,080 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:12,083 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:53:12,083 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:12,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:12,084 INFO L82 PathProgramCache]: Analyzing trace with hash 130660739, now seen corresponding path program 1 times [2019-01-12 00:53:12,084 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:12,084 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:12,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:12,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:12,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:12,338 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-01-12 00:53:12,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:12,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:12,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:12,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:12,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:12,341 INFO L87 Difference]: Start difference. First operand 659 states and 888 transitions. Second operand 4 states. [2019-01-12 00:53:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:14,304 INFO L93 Difference]: Finished difference Result 1449 states and 1931 transitions. [2019-01-12 00:53:14,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:14,305 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 152 [2019-01-12 00:53:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:14,310 INFO L225 Difference]: With dead ends: 1449 [2019-01-12 00:53:14,310 INFO L226 Difference]: Without dead ends: 792 [2019-01-12 00:53:14,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:14,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2019-01-12 00:53:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 790. [2019-01-12 00:53:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:53:14,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1025 transitions. [2019-01-12 00:53:14,338 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1025 transitions. Word has length 152 [2019-01-12 00:53:14,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:14,338 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1025 transitions. [2019-01-12 00:53:14,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:14,338 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1025 transitions. [2019-01-12 00:53:14,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-01-12 00:53:14,343 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:14,343 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:14,343 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:14,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:14,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1709270971, now seen corresponding path program 1 times [2019-01-12 00:53:14,345 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:14,345 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:14,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:14,347 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:14,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:14,523 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-01-12 00:53:14,524 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:14,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:14,525 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:14,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:14,527 INFO L87 Difference]: Start difference. First operand 790 states and 1025 transitions. Second operand 3 states. [2019-01-12 00:53:15,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:15,900 INFO L93 Difference]: Finished difference Result 1709 states and 2245 transitions. [2019-01-12 00:53:15,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:15,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-01-12 00:53:15,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:15,908 INFO L225 Difference]: With dead ends: 1709 [2019-01-12 00:53:15,908 INFO L226 Difference]: Without dead ends: 1052 [2019-01-12 00:53:15,910 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:15,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1052 states. [2019-01-12 00:53:15,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1052 to 1052. [2019-01-12 00:53:15,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2019-01-12 00:53:15,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1323 transitions. [2019-01-12 00:53:15,934 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1323 transitions. Word has length 156 [2019-01-12 00:53:15,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:15,935 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1323 transitions. [2019-01-12 00:53:15,936 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:15,937 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1323 transitions. [2019-01-12 00:53:15,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2019-01-12 00:53:15,941 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:15,941 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:15,941 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:15,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:15,942 INFO L82 PathProgramCache]: Analyzing trace with hash -467564647, now seen corresponding path program 1 times [2019-01-12 00:53:15,942 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:15,942 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:15,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:15,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:15,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:16,044 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 00:53:16,044 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:16,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:16,045 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:16,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:16,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:16,045 INFO L87 Difference]: Start difference. First operand 1052 states and 1323 transitions. Second operand 4 states. [2019-01-12 00:53:17,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:17,073 INFO L93 Difference]: Finished difference Result 3281 states and 4154 transitions. [2019-01-12 00:53:17,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:17,076 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 165 [2019-01-12 00:53:17,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:17,087 INFO L225 Difference]: With dead ends: 3281 [2019-01-12 00:53:17,088 INFO L226 Difference]: Without dead ends: 2362 [2019-01-12 00:53:17,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:17,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-01-12 00:53:17,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1707. [2019-01-12 00:53:17,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:53:17,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2099 transitions. [2019-01-12 00:53:17,138 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2099 transitions. Word has length 165 [2019-01-12 00:53:17,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:17,139 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 2099 transitions. [2019-01-12 00:53:17,139 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:17,139 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2099 transitions. [2019-01-12 00:53:17,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-01-12 00:53:17,148 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:17,148 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 00:53:17,148 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:17,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:17,152 INFO L82 PathProgramCache]: Analyzing trace with hash 765811402, now seen corresponding path program 1 times [2019-01-12 00:53:17,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:17,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:17,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:17,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:17,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:17,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:17,681 WARN L181 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2019-01-12 00:53:17,714 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 00:53:17,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:17,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:17,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 00:53:17,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 00:53:17,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:17,717 INFO L87 Difference]: Start difference. First operand 1707 states and 2099 transitions. Second operand 5 states. [2019-01-12 00:53:19,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:19,415 INFO L93 Difference]: Finished difference Result 3805 states and 4667 transitions. [2019-01-12 00:53:19,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:53:19,416 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 171 [2019-01-12 00:53:19,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:19,427 INFO L225 Difference]: With dead ends: 3805 [2019-01-12 00:53:19,427 INFO L226 Difference]: Without dead ends: 2231 [2019-01-12 00:53:19,431 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 00:53:19,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2231 states. [2019-01-12 00:53:19,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2231 to 1969. [2019-01-12 00:53:19,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-01-12 00:53:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2373 transitions. [2019-01-12 00:53:19,482 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2373 transitions. Word has length 171 [2019-01-12 00:53:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:19,483 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2373 transitions. [2019-01-12 00:53:19,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 00:53:19,484 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2373 transitions. [2019-01-12 00:53:19,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 00:53:19,515 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:19,516 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 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] [2019-01-12 00:53:19,516 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:19,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:19,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1768959985, now seen corresponding path program 1 times [2019-01-12 00:53:19,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:19,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:19,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:19,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:19,618 INFO L134 CoverageAnalysis]: Checked inductivity of 103 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-01-12 00:53:19,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:19,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:53:19,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:19,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:19,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:19,620 INFO L87 Difference]: Start difference. First operand 1969 states and 2373 transitions. Second operand 3 states. [2019-01-12 00:53:20,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:20,518 INFO L93 Difference]: Finished difference Result 4067 states and 4887 transitions. [2019-01-12 00:53:20,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:20,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 174 [2019-01-12 00:53:20,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:20,527 INFO L225 Difference]: With dead ends: 4067 [2019-01-12 00:53:20,527 INFO L226 Difference]: Without dead ends: 1969 [2019-01-12 00:53:20,531 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-01-12 00:53:20,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2019-01-12 00:53:20,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:20,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2015 transitions. [2019-01-12 00:53:20,567 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2015 transitions. Word has length 174 [2019-01-12 00:53:20,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:20,568 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2015 transitions. [2019-01-12 00:53:20,568 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:20,568 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2015 transitions. [2019-01-12 00:53:20,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2019-01-12 00:53:20,574 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:20,575 INFO L402 BasicCegarLoop]: trace histogram [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, 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] [2019-01-12 00:53:20,575 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:20,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:20,575 INFO L82 PathProgramCache]: Analyzing trace with hash 1455962891, now seen corresponding path program 1 times [2019-01-12 00:53:20,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:20,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:20,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:20,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:20,752 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-01-12 00:53:20,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:20,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:53:20,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:53:20,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:53:20,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:20,753 INFO L87 Difference]: Start difference. First operand 1838 states and 2015 transitions. Second operand 3 states. [2019-01-12 00:53:21,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:21,268 INFO L93 Difference]: Finished difference Result 3674 states and 4028 transitions. [2019-01-12 00:53:21,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:53:21,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 189 [2019-01-12 00:53:21,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:21,276 INFO L225 Difference]: With dead ends: 3674 [2019-01-12 00:53:21,276 INFO L226 Difference]: Without dead ends: 1838 [2019-01-12 00:53:21,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:53:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states. [2019-01-12 00:53:21,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1838. [2019-01-12 00:53:21,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:53:21,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2010 transitions. [2019-01-12 00:53:21,314 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2010 transitions. Word has length 189 [2019-01-12 00:53:21,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:21,314 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2010 transitions. [2019-01-12 00:53:21,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:53:21,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2010 transitions. [2019-01-12 00:53:21,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2019-01-12 00:53:21,321 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:21,321 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:21,323 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:21,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:21,323 INFO L82 PathProgramCache]: Analyzing trace with hash -380467305, now seen corresponding path program 1 times [2019-01-12 00:53:21,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:21,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:21,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:21,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:21,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 27 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-01-12 00:53:21,548 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:53:21,548 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 00:53:21,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:21,707 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:53:21,840 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2019-01-12 00:53:21,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:53:21,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2019-01-12 00:53:21,864 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 00:53:21,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 00:53:21,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-01-12 00:53:21,865 INFO L87 Difference]: Start difference. First operand 1838 states and 2010 transitions. Second operand 7 states. [2019-01-12 00:53:25,020 WARN L181 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 00:53:26,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:26,010 INFO L93 Difference]: Finished difference Result 4079 states and 4461 transitions. [2019-01-12 00:53:26,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 00:53:26,011 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 218 [2019-01-12 00:53:26,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:26,020 INFO L225 Difference]: With dead ends: 4079 [2019-01-12 00:53:26,021 INFO L226 Difference]: Without dead ends: 1981 [2019-01-12 00:53:26,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 220 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-01-12 00:53:26,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-01-12 00:53:26,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1707. [2019-01-12 00:53:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-01-12 00:53:26,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1824 transitions. [2019-01-12 00:53:26,060 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1824 transitions. Word has length 218 [2019-01-12 00:53:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:26,061 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1824 transitions. [2019-01-12 00:53:26,061 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 00:53:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1824 transitions. [2019-01-12 00:53:26,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2019-01-12 00:53:26,068 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:26,068 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 00:53:26,070 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:26,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:26,070 INFO L82 PathProgramCache]: Analyzing trace with hash -238660684, now seen corresponding path program 1 times [2019-01-12 00:53:26,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:26,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:26,072 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:26,072 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:26,316 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 238 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-01-12 00:53:26,317 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:53:26,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:53:26,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:53:26,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:53:26,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:53:26,319 INFO L87 Difference]: Start difference. First operand 1707 states and 1824 transitions. Second operand 4 states. [2019-01-12 00:53:27,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:27,180 INFO L93 Difference]: Finished difference Result 3805 states and 4060 transitions. [2019-01-12 00:53:27,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:53:27,181 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 274 [2019-01-12 00:53:27,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:27,188 INFO L225 Difference]: With dead ends: 3805 [2019-01-12 00:53:27,188 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:53:27,190 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 00:53:27,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:53:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1576. [2019-01-12 00:53:27,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1576 states. [2019-01-12 00:53:27,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 1674 transitions. [2019-01-12 00:53:27,219 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 1674 transitions. Word has length 274 [2019-01-12 00:53:27,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:27,220 INFO L480 AbstractCegarLoop]: Abstraction has 1576 states and 1674 transitions. [2019-01-12 00:53:27,220 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:53:27,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 1674 transitions. [2019-01-12 00:53:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2019-01-12 00:53:27,227 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:53:27,227 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:53:27,228 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:53:27,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:53:27,228 INFO L82 PathProgramCache]: Analyzing trace with hash 1346608203, now seen corresponding path program 1 times [2019-01-12 00:53:27,228 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:53:27,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:53:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:27,231 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:27,231 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:53:27,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:28,379 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 275 proven. 4 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-01-12 00:53:28,379 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:53:28,380 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 00:53:28,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:53:28,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:53:28,494 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:53:28,601 INFO L134 CoverageAnalysis]: Checked inductivity of 372 backedges. 234 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-01-12 00:53:28,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:53:28,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [12] total 14 [2019-01-12 00:53:28,621 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-01-12 00:53:28,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-01-12 00:53:28,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:53:28,621 INFO L87 Difference]: Start difference. First operand 1576 states and 1674 transitions. Second operand 14 states. [2019-01-12 00:53:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:53:30,696 INFO L93 Difference]: Finished difference Result 3071 states and 3262 transitions. [2019-01-12 00:53:30,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 00:53:30,697 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 296 [2019-01-12 00:53:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:53:30,698 INFO L225 Difference]: With dead ends: 3071 [2019-01-12 00:53:30,698 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:53:30,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=157, Invalid=263, Unknown=0, NotChecked=0, Total=420 [2019-01-12 00:53:30,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:53:30,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:53:30,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:53:30,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:53:30,701 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 296 [2019-01-12 00:53:30,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:53:30,701 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:53:30,701 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-01-12 00:53:30,701 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:53:30,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:53:30,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:53:30,757 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:30,821 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:53:31,981 WARN L181 SmtUtils]: Spent 1.16 s on a formula simplification. DAG size of input: 89 DAG size of output: 60 [2019-01-12 00:53:32,422 WARN L181 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 59 [2019-01-12 00:53:32,424 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,425 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:53:32,426 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:53:32,427 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:53:32,428 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,429 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:53:32,430 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:53:32,431 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:53:32,431 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse6 (= ~a7~0 1))) (let ((.cse11 (not .cse6))) (let ((.cse3 (= ~a16~0 5)) (.cse8 (and .cse11 (not (= 6 ~a16~0)))) (.cse1 (<= ~a17~0 0)) (.cse2 (= ~a21~0 1)) (.cse5 (= ~a20~0 1)) (.cse12 (= ~a16~0 6)) (.cse9 (<= ~a21~0 0)) (.cse7 (= ~a16~0 4)) (.cse10 (= ~a8~0 13)) (.cse4 (= ~a17~0 1)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and (and .cse4 .cse2 .cse5) .cse0) (and .cse6 .cse7 .cse1 .cse2) (and .cse6 (or (and .cse2 .cse5 .cse3) (and (and .cse2 .cse5) .cse4))) (and .cse4 .cse0 .cse2 .cse8 .cse3) (and .cse9 (and .cse6 .cse1 .cse5) .cse0) (and .cse6 .cse1 .cse2 .cse3) (and .cse6 .cse9 .cse10 .cse4 .cse0 .cse5) (and .cse7 .cse0 .cse1 .cse2) (and .cse11 .cse4 .cse0 .cse2 .cse12) (and .cse11 .cse0 .cse1 .cse2 .cse12) (and .cse0 (or (and .cse7 .cse4 .cse2 .cse8) (and .cse1 .cse2 .cse5 .cse12))) (and .cse6 .cse9 .cse7 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse10 .cse4 .cse0 (<= ~a20~0 0)))))) [2019-01-12 00:53:32,431 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,431 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,431 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:53:32,432 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:53:32,433 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:53:32,437 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:53:32,437 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:53:32,437 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:53:32,438 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:53:32,439 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:53:32,440 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a7~0 1))) (let ((.cse12 (not .cse4)) (.cse2 (= ~a21~0 1)) (.cse7 (= ~a20~0 1)) (.cse8 (= ~a17~0 1))) (let ((.cse6 (and (and .cse2 .cse7) .cse8)) (.cse3 (= ~a16~0 5)) (.cse9 (and .cse12 (not (= 6 ~a16~0)))) (.cse1 (<= ~a17~0 0)) (.cse13 (= ~a16~0 6)) (.cse10 (<= ~a21~0 0)) (.cse5 (= ~a16~0 4)) (.cse11 (= ~a8~0 13)) (.cse0 (= ~a12~0 8))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse5 .cse1 .cse2) (and .cse6 .cse0) (and .cse4 (or (and .cse2 .cse7 .cse3) .cse6)) (and .cse8 .cse0 .cse2 .cse9 .cse3) (and .cse10 (and .cse4 .cse1 .cse7) .cse0) (and .cse4 .cse1 .cse2 .cse3) (and .cse4 .cse10 .cse11 .cse8 .cse0 .cse7) (and .cse5 .cse0 .cse1 .cse2) (and .cse12 .cse8 .cse0 .cse2 .cse13) (and .cse12 .cse0 .cse1 .cse2 .cse13) (and .cse0 (or (and .cse5 .cse8 .cse2 .cse9) (and .cse1 .cse2 .cse7 .cse13))) (and .cse4 .cse10 .cse5 (or (= ULTIMATE.start_calculate_output_~input 2) (= ULTIMATE.start_calculate_output_~input 4) (= 5 ULTIMATE.start_calculate_output_~input) (= ULTIMATE.start_calculate_output_~input 6)) .cse11 .cse8 .cse0 (<= ~a20~0 0)))))) [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:53:32,441 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:53:32,442 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:53:32,442 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,443 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:53:32,444 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:53:32,445 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,446 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:53:32,447 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:53:32,448 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,449 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 551) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:53:32,450 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:53:32,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:53:32 BoogieIcfgContainer [2019-01-12 00:53:32,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:53:32,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:53:32,487 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:53:32,488 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:53:32,490 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:53:07" (3/4) ... [2019-01-12 00:53:32,494 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:53:32,521 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:53:32,524 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:53:32,747 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:53:32,752 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:53:32,753 INFO L168 Benchmark]: Toolchain (without parser) took 29473.50 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.2 MB). Free memory was 951.3 MB in the beginning and 1.2 GB in the end (delta: -270.6 MB). Peak memory consumption was 219.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,754 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:53:32,755 INFO L168 Benchmark]: CACSL2BoogieTranslator took 734.72 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,755 INFO L168 Benchmark]: Boogie Procedure Inliner took 202.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,755 INFO L168 Benchmark]: Boogie Preprocessor took 106.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,756 INFO L168 Benchmark]: RCFGBuilder took 3320.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,758 INFO L168 Benchmark]: TraceAbstraction took 24838.47 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 993.5 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 127.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,758 INFO L168 Benchmark]: Witness Printer took 264.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:53:32,762 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 734.72 ms. Allocated memory is still 1.0 GB. Free memory was 945.9 MB in the beginning and 919.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 202.27 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3320.82 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 993.5 MB in the end (delta: 107.1 MB). Peak memory consumption was 107.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24838.47 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 369.6 MB). Free memory was 993.5 MB in the beginning and 1.2 GB in the end (delta: -242.1 MB). Peak memory consumption was 127.5 MB. Max. memory is 11.5 GB. * Witness Printer took 264.89 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 13.7 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 551]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || (((a17 == 1 && a21 == 1) && a20 == 1) && a12 == 8)) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (a7 == 1 && (((a21 == 1 && a20 == 1) && a16 == 5) || ((a21 == 1 && a20 == 1) && a17 == 1)))) || ((((a17 == 1 && a12 == 8) && a21 == 1) && !(a7 == 1) && !(6 == a16)) && a16 == 5)) || ((a21 <= 0 && (a7 == 1 && a17 <= 0) && a20 == 1) && a12 == 8)) || (((a7 == 1 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a17 == 1) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (a12 == 8 && ((((a16 == 4 && a17 == 1) && a21 == 1) && !(a7 == 1) && !(6 == a16)) || (((a17 <= 0 && a21 == 1) && a20 == 1) && a16 == 6)))) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: ((((((((((((((a12 == 8 && a17 <= 0) && a21 == 1) && a16 == 5) || (((a7 == 1 && a16 == 4) && a17 <= 0) && a21 == 1)) || (((a21 == 1 && a20 == 1) && a17 == 1) && a12 == 8)) || (a7 == 1 && (((a21 == 1 && a20 == 1) && a16 == 5) || ((a21 == 1 && a20 == 1) && a17 == 1)))) || ((((a17 == 1 && a12 == 8) && a21 == 1) && !(a7 == 1) && !(6 == a16)) && a16 == 5)) || ((a21 <= 0 && (a7 == 1 && a17 <= 0) && a20 == 1) && a12 == 8)) || (((a7 == 1 && a17 <= 0) && a21 == 1) && a16 == 5)) || (((((a7 == 1 && a21 <= 0) && a8 == 13) && a17 == 1) && a12 == 8) && a20 == 1)) || (((a16 == 4 && a12 == 8) && a17 <= 0) && a21 == 1)) || ((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a16 == 6)) || ((((!(a7 == 1) && a12 == 8) && a17 <= 0) && a21 == 1) && a16 == 6)) || (a12 == 8 && ((((a16 == 4 && a17 == 1) && a21 == 1) && !(a7 == 1) && !(6 == a16)) || (((a17 <= 0 && a21 == 1) && a20 == 1) && a16 == 6)))) || (((((((a7 == 1 && a21 <= 0) && a16 == 4) && (((input == 2 || input == 4) || 5 == input) || input == 6)) && a8 == 13) && a17 == 1) && a12 == 8) && a20 <= 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 24.7s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 17.9s AutomataDifference, 0.0s DeadEndRemovalTime, 1.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 609 SDtfs, 2932 SDslu, 133 SDs, 0 SdLazy, 7086 SolverSat, 940 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 580 GetRequests, 534 SyntacticMatches, 3 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, 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: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1979 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 39 NumberOfFragments, 516 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2766 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 863 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 2711 NumberOfCodeBlocks, 2711 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2697 ConstructedInterpolants, 0 QuantifiedInterpolants, 1793940 SizeOfPredicates, 2 NumberOfNonLiveVariables, 895 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 14 InterpolantComputations, 12 PerfectInterpolantSequences, 1895/1926 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...