./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label02_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_label02_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 addc9e4e4fc897318cfe4d26c9760729a73864e1 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:49:24,381 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:49:24,383 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:49:24,396 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:49:24,397 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:49:24,398 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:49:24,399 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:49:24,403 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:49:24,404 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:49:24,405 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:49:24,406 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:49:24,406 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:49:24,407 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:49:24,408 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:49:24,409 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:49:24,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:49:24,411 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:49:24,413 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:49:24,415 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:49:24,416 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:49:24,417 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:49:24,419 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:49:24,421 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:49:24,421 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:49:24,421 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:49:24,422 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:49:24,424 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:49:24,424 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:49:24,425 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:49:24,426 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:49:24,426 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:49:24,427 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:49:24,427 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:49:24,428 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:49:24,429 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:49:24,430 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:49:24,430 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:49:24,445 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:49:24,446 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:49:24,447 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:49:24,447 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:49:24,447 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:49:24,448 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:49:24,448 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:49:24,448 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:49:24,448 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:49:24,448 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:49:24,448 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:49:24,449 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:49:24,450 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:49:24,450 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:49:24,450 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:49:24,450 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:49:24,450 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:49:24,450 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:49:24,451 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:49:24,451 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:49:24,451 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:49:24,451 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:49:24,451 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:49:24,451 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 -> addc9e4e4fc897318cfe4d26c9760729a73864e1 [2019-01-12 00:49:24,487 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:49:24,499 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:49:24,503 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:49:24,504 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:49:24,505 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:49:24,505 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2019-01-12 00:49:24,560 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3425268/47270d593a974e6c8dff9efbcd62828e/FLAG7d8af3158 [2019-01-12 00:49:25,108 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:49:25,110 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label02_true-unreach-call_false-termination.c [2019-01-12 00:49:25,126 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3425268/47270d593a974e6c8dff9efbcd62828e/FLAG7d8af3158 [2019-01-12 00:49:25,349 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7a3425268/47270d593a974e6c8dff9efbcd62828e [2019-01-12 00:49:25,352 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:49:25,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:49:25,355 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:25,355 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:49:25,361 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:49:25,362 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:25" (1/1) ... [2019-01-12 00:49:25,366 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5c3be4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:25, skipping insertion in model container [2019-01-12 00:49:25,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:49:25" (1/1) ... [2019-01-12 00:49:25,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:49:25,427 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:49:25,901 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:25,911 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:49:26,074 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:49:26,094 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:49:26,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26 WrapperNode [2019-01-12 00:49:26,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:49:26,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:26,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:49:26,096 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:49:26,107 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:49:26" (1/1) ... [2019-01-12 00:49:26,213 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:49:26" (1/1) ... [2019-01-12 00:49:26,281 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:49:26,281 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:49:26,281 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:49:26,281 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:49:26,293 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,293 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,306 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,307 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,352 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,363 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (1/1) ... [2019-01-12 00:49:26,374 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:49:26,379 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:49:26,379 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:49:26,379 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:49:26,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (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:49:26,454 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:49:26,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:49:29,229 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:49:29,230 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:49:29,231 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:29 BoogieIcfgContainer [2019-01-12 00:49:29,231 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:49:29,232 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:49:29,232 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:49:29,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:49:29,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:49:25" (1/3) ... [2019-01-12 00:49:29,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1611f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:49:29, skipping insertion in model container [2019-01-12 00:49:29,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:49:26" (2/3) ... [2019-01-12 00:49:29,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1611f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:49:29, skipping insertion in model container [2019-01-12 00:49:29,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:29" (3/3) ... [2019-01-12 00:49:29,239 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label02_true-unreach-call_false-termination.c [2019-01-12 00:49:29,249 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:49:29,258 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:49:29,271 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:49:29,303 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:49:29,304 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:49:29,304 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:49:29,304 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:49:29,305 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:49:29,305 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:49:29,305 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:49:29,305 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:49:29,305 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:49:29,327 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2019-01-12 00:49:29,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-01-12 00:49:29,337 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:29,339 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] [2019-01-12 00:49:29,341 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:29,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:29,348 INFO L82 PathProgramCache]: Analyzing trace with hash -776841673, now seen corresponding path program 1 times [2019-01-12 00:49:29,350 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:29,350 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:29,389 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:29,389 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:29,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:29,975 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:49:29,978 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:29,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:49:29,984 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:29,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:29,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:30,001 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2019-01-12 00:49:32,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:32,365 INFO L93 Difference]: Finished difference Result 662 states and 1178 transitions. [2019-01-12 00:49:32,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:32,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-01-12 00:49:32,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:32,386 INFO L225 Difference]: With dead ends: 662 [2019-01-12 00:49:32,386 INFO L226 Difference]: Without dead ends: 397 [2019-01-12 00:49:32,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:32,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2019-01-12 00:49:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2019-01-12 00:49:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2019-01-12 00:49:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2019-01-12 00:49:32,444 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 90 [2019-01-12 00:49:32,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:32,445 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2019-01-12 00:49:32,445 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:32,445 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2019-01-12 00:49:32,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-01-12 00:49:32,449 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:32,450 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:32,450 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:32,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:32,450 INFO L82 PathProgramCache]: Analyzing trace with hash 904352266, now seen corresponding path program 1 times [2019-01-12 00:49:32,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:32,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:32,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:32,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:49:32,628 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:32,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:49:32,630 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:32,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:32,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:32,631 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2019-01-12 00:49:33,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:33,952 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2019-01-12 00:49:33,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:33,952 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-01-12 00:49:33,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:33,959 INFO L225 Difference]: With dead ends: 1054 [2019-01-12 00:49:33,959 INFO L226 Difference]: Without dead ends: 790 [2019-01-12 00:49:33,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2019-01-12 00:49:33,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2019-01-12 00:49:33,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2019-01-12 00:49:34,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1067 transitions. [2019-01-12 00:49:34,002 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1067 transitions. Word has length 96 [2019-01-12 00:49:34,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:34,002 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1067 transitions. [2019-01-12 00:49:34,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1067 transitions. [2019-01-12 00:49:34,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-01-12 00:49:34,007 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:34,008 INFO L402 BasicCegarLoop]: trace histogram [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] [2019-01-12 00:49:34,008 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:34,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:34,008 INFO L82 PathProgramCache]: Analyzing trace with hash 1983827210, now seen corresponding path program 1 times [2019-01-12 00:49:34,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:34,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:34,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:34,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:34,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:34,140 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:49:34,141 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:34,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:34,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:34,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:34,142 INFO L87 Difference]: Start difference. First operand 790 states and 1067 transitions. Second operand 3 states. [2019-01-12 00:49:35,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:35,550 INFO L93 Difference]: Finished difference Result 2233 states and 3029 transitions. [2019-01-12 00:49:35,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:35,551 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-01-12 00:49:35,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:35,559 INFO L225 Difference]: With dead ends: 2233 [2019-01-12 00:49:35,559 INFO L226 Difference]: Without dead ends: 1445 [2019-01-12 00:49:35,561 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:49:35,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2019-01-12 00:49:35,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2019-01-12 00:49:35,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:49:35,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1878 transitions. [2019-01-12 00:49:35,600 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1878 transitions. Word has length 97 [2019-01-12 00:49:35,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:35,600 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1878 transitions. [2019-01-12 00:49:35,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:35,601 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1878 transitions. [2019-01-12 00:49:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 00:49:35,606 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:35,606 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:35,606 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:35,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1892128057, now seen corresponding path program 1 times [2019-01-12 00:49:35,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:35,608 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:35,608 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-12 00:49:35,761 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:35,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:35,763 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:35,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:35,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:35,764 INFO L87 Difference]: Start difference. First operand 1445 states and 1878 transitions. Second operand 3 states. [2019-01-12 00:49:37,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:37,137 INFO L93 Difference]: Finished difference Result 3150 states and 4119 transitions. [2019-01-12 00:49:37,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:37,138 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-01-12 00:49:37,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:37,148 INFO L225 Difference]: With dead ends: 3150 [2019-01-12 00:49:37,148 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:49:37,151 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:49:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:49:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445. [2019-01-12 00:49:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1445 states. [2019-01-12 00:49:37,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1873 transitions. [2019-01-12 00:49:37,220 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1873 transitions. Word has length 116 [2019-01-12 00:49:37,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:37,221 INFO L480 AbstractCegarLoop]: Abstraction has 1445 states and 1873 transitions. [2019-01-12 00:49:37,221 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1873 transitions. [2019-01-12 00:49:37,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-12 00:49:37,230 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:37,231 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:37,231 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:37,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:37,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1006771335, now seen corresponding path program 1 times [2019-01-12 00:49:37,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:37,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:37,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:37,417 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-01-12 00:49:37,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:37,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:37,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:37,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:37,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:37,421 INFO L87 Difference]: Start difference. First operand 1445 states and 1873 transitions. Second operand 3 states. [2019-01-12 00:49:38,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:38,014 INFO L93 Difference]: Finished difference Result 3805 states and 4890 transitions. [2019-01-12 00:49:38,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:38,014 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 133 [2019-01-12 00:49:38,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:38,025 INFO L225 Difference]: With dead ends: 3805 [2019-01-12 00:49:38,025 INFO L226 Difference]: Without dead ends: 2362 [2019-01-12 00:49:38,028 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:49:38,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2019-01-12 00:49:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 1838. [2019-01-12 00:49:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:49:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2315 transitions. [2019-01-12 00:49:38,067 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2315 transitions. Word has length 133 [2019-01-12 00:49:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:38,067 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2315 transitions. [2019-01-12 00:49:38,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:38,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2315 transitions. [2019-01-12 00:49:38,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-01-12 00:49:38,071 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:38,072 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:38,072 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:38,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:38,072 INFO L82 PathProgramCache]: Analyzing trace with hash 546693328, now seen corresponding path program 1 times [2019-01-12 00:49:38,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:38,072 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:38,073 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:38,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:38,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:38,217 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-12 00:49:38,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:38,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:49:38,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:38,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:38,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:38,220 INFO L87 Difference]: Start difference. First operand 1838 states and 2315 transitions. Second operand 3 states. [2019-01-12 00:49:38,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:38,972 INFO L93 Difference]: Finished difference Result 3936 states and 4944 transitions. [2019-01-12 00:49:38,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:38,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-01-12 00:49:38,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:38,981 INFO L225 Difference]: With dead ends: 3936 [2019-01-12 00:49:38,981 INFO L226 Difference]: Without dead ends: 2100 [2019-01-12 00:49:38,984 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:49:38,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2019-01-12 00:49:39,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 2100. [2019-01-12 00:49:39,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-01-12 00:49:39,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2595 transitions. [2019-01-12 00:49:39,025 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2595 transitions. Word has length 155 [2019-01-12 00:49:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:39,026 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 2595 transitions. [2019-01-12 00:49:39,026 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:39,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2595 transitions. [2019-01-12 00:49:39,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-01-12 00:49:39,031 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:39,032 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,032 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:39,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:39,032 INFO L82 PathProgramCache]: Analyzing trace with hash -967776360, now seen corresponding path program 1 times [2019-01-12 00:49:39,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:39,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:39,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:39,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:39,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:39,482 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-01-12 00:49:39,579 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-12 00:49:39,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:39,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 00:49:39,580 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:49:39,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:49:39,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:49:39,580 INFO L87 Difference]: Start difference. First operand 2100 states and 2595 transitions. Second operand 8 states. [2019-01-12 00:49:41,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:41,035 INFO L93 Difference]: Finished difference Result 4371 states and 5367 transitions. [2019-01-12 00:49:41,035 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 00:49:41,035 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 159 [2019-01-12 00:49:41,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:41,043 INFO L225 Difference]: With dead ends: 4371 [2019-01-12 00:49:41,044 INFO L226 Difference]: Without dead ends: 2273 [2019-01-12 00:49:41,046 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:49:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2273 states. [2019-01-12 00:49:41,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2273 to 2100. [2019-01-12 00:49:41,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2100 states. [2019-01-12 00:49:41,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2583 transitions. [2019-01-12 00:49:41,093 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2583 transitions. Word has length 159 [2019-01-12 00:49:41,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:41,093 INFO L480 AbstractCegarLoop]: Abstraction has 2100 states and 2583 transitions. [2019-01-12 00:49:41,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:49:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2583 transitions. [2019-01-12 00:49:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-12 00:49:41,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:41,098 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:41,098 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:41,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:41,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1011248568, now seen corresponding path program 1 times [2019-01-12 00:49:41,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:41,099 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:41,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:41,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:41,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:41,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:41,558 WARN L181 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 8 [2019-01-12 00:49:41,577 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-01-12 00:49:41,577 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:41,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:41,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:41,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:41,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:41,578 INFO L87 Difference]: Start difference. First operand 2100 states and 2583 transitions. Second operand 4 states. [2019-01-12 00:49:42,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:42,633 INFO L93 Difference]: Finished difference Result 4331 states and 5314 transitions. [2019-01-12 00:49:42,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:42,634 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 192 [2019-01-12 00:49:42,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:42,642 INFO L225 Difference]: With dead ends: 4331 [2019-01-12 00:49:42,642 INFO L226 Difference]: Without dead ends: 2233 [2019-01-12 00:49:42,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2233 states. [2019-01-12 00:49:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2233 to 2231. [2019-01-12 00:49:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2231 states. [2019-01-12 00:49:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2231 states to 2231 states and 2606 transitions. [2019-01-12 00:49:42,687 INFO L78 Accepts]: Start accepts. Automaton has 2231 states and 2606 transitions. Word has length 192 [2019-01-12 00:49:42,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:42,687 INFO L480 AbstractCegarLoop]: Abstraction has 2231 states and 2606 transitions. [2019-01-12 00:49:42,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2231 states and 2606 transitions. [2019-01-12 00:49:42,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-01-12 00:49:42,692 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:42,692 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:42,693 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:42,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:42,693 INFO L82 PathProgramCache]: Analyzing trace with hash -566866055, now seen corresponding path program 1 times [2019-01-12 00:49:42,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:42,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:42,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:42,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:42,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:42,887 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-01-12 00:49:42,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:42,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:49:42,888 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:49:42,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:49:42,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:49:42,888 INFO L87 Difference]: Start difference. First operand 2231 states and 2606 transitions. Second operand 3 states. [2019-01-12 00:49:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:46,024 INFO L93 Difference]: Finished difference Result 2757 states and 3185 transitions. [2019-01-12 00:49:46,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:46,025 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 194 [2019-01-12 00:49:46,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:46,042 INFO L225 Difference]: With dead ends: 2757 [2019-01-12 00:49:46,042 INFO L226 Difference]: Without dead ends: 2755 [2019-01-12 00:49:46,044 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:49:46,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2755 states. [2019-01-12 00:49:46,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2755 to 1969. [2019-01-12 00:49:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-01-12 00:49:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2324 transitions. [2019-01-12 00:49:46,149 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2324 transitions. Word has length 194 [2019-01-12 00:49:46,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:46,149 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2324 transitions. [2019-01-12 00:49:46,149 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:49:46,150 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2324 transitions. [2019-01-12 00:49:46,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2019-01-12 00:49:46,160 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:46,160 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2019-01-12 00:49:46,161 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:46,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash 643345862, now seen corresponding path program 1 times [2019-01-12 00:49:46,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:46,162 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:46,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:46,168 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:46,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:46,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2019-01-12 00:49:46,437 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:46,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:49:46,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:46,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:46,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:46,438 INFO L87 Difference]: Start difference. First operand 1969 states and 2324 transitions. Second operand 4 states. [2019-01-12 00:49:47,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:47,138 INFO L93 Difference]: Finished difference Result 4460 states and 5224 transitions. [2019-01-12 00:49:47,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:49:47,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 198 [2019-01-12 00:49:47,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:47,148 INFO L225 Difference]: With dead ends: 4460 [2019-01-12 00:49:47,149 INFO L226 Difference]: Without dead ends: 2493 [2019-01-12 00:49:47,151 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:49:47,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2019-01-12 00:49:47,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 1969. [2019-01-12 00:49:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2019-01-12 00:49:47,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2312 transitions. [2019-01-12 00:49:47,190 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2312 transitions. Word has length 198 [2019-01-12 00:49:47,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:47,191 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2312 transitions. [2019-01-12 00:49:47,191 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:47,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2312 transitions. [2019-01-12 00:49:47,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2019-01-12 00:49:47,198 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:47,198 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, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 00:49:47,198 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:47,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:47,199 INFO L82 PathProgramCache]: Analyzing trace with hash -333400197, now seen corresponding path program 1 times [2019-01-12 00:49:47,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:47,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:47,199 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:47,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:47,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:47,499 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 206 proven. 0 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2019-01-12 00:49:47,500 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:49:47,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 00:49:47,500 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 00:49:47,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 00:49:47,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:49:47,501 INFO L87 Difference]: Start difference. First operand 1969 states and 2312 transitions. Second operand 6 states. [2019-01-12 00:49:48,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:48,902 INFO L93 Difference]: Finished difference Result 4105 states and 4797 transitions. [2019-01-12 00:49:48,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 00:49:48,902 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 219 [2019-01-12 00:49:48,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:48,910 INFO L225 Difference]: With dead ends: 4105 [2019-01-12 00:49:48,910 INFO L226 Difference]: Without dead ends: 2138 [2019-01-12 00:49:48,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-01-12 00:49:48,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2138 states. [2019-01-12 00:49:48,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2138 to 1838. [2019-01-12 00:49:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1838 states. [2019-01-12 00:49:48,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2102 transitions. [2019-01-12 00:49:48,944 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2102 transitions. Word has length 219 [2019-01-12 00:49:48,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:48,945 INFO L480 AbstractCegarLoop]: Abstraction has 1838 states and 2102 transitions. [2019-01-12 00:49:48,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 00:49:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2102 transitions. [2019-01-12 00:49:48,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2019-01-12 00:49:48,950 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:49:48,950 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:49:48,951 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:49:48,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:49:48,951 INFO L82 PathProgramCache]: Analyzing trace with hash 471134404, now seen corresponding path program 1 times [2019-01-12 00:49:48,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:49:48,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:49:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:48,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:48,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:49:48,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 4 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2019-01-12 00:49:49,172 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:49:49,172 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:49:49,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:49:49,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:49:49,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:49:49,406 INFO L134 CoverageAnalysis]: Checked inductivity of 312 backedges. 194 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-01-12 00:49:49,434 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:49:49,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 4 [2019-01-12 00:49:49,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:49:49,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:49:49,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:49:49,436 INFO L87 Difference]: Start difference. First operand 1838 states and 2102 transitions. Second operand 4 states. [2019-01-12 00:49:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:49:51,381 INFO L93 Difference]: Finished difference Result 3672 states and 4201 transitions. [2019-01-12 00:49:51,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:49:51,382 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 241 [2019-01-12 00:49:51,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:49:51,382 INFO L225 Difference]: With dead ends: 3672 [2019-01-12 00:49:51,382 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:49:51,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 242 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:49:51,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:49:51,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:49:51,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:49:51,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:49:51,385 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 241 [2019-01-12 00:49:51,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:49:51,386 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:49:51,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:49:51,386 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:49:51,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:49:51,390 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:49:51,423 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,429 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,495 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,520 WARN L181 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 86 [2019-01-12 00:49:51,541 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,546 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,621 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,639 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:49:51,653 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 87 [2019-01-12 00:49:52,901 WARN L181 SmtUtils]: Spent 1.25 s on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-01-12 00:49:53,340 WARN L181 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 34 [2019-01-12 00:49:53,343 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2019-01-12 00:49:53,343 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2019-01-12 00:49:53,343 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,343 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2019-01-12 00:49:53,344 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2019-01-12 00:49:53,345 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2019-01-12 00:49:53,346 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2019-01-12 00:49:53,347 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 446) no Hoare annotation was computed. [2019-01-12 00:49:53,348 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse1 (= ~a16~0 4)) (.cse0 (<= ~a21~0 0)) (.cse3 (not (= ~a7~0 1))) (.cse7 (= ~a16~0 6)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4) (and .cse4 (= ~a20~0 1) .cse5) (and .cse1 .cse2 .cse5 .cse6) (and .cse3 .cse1 .cse5) (and .cse0 .cse7) (and .cse3 .cse5 .cse7 .cse6) (and .cse5 .cse6 (= ~a16~0 5)))) [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2019-01-12 00:49:53,349 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2019-01-12 00:49:53,350 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2019-01-12 00:49:53,351 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2019-01-12 00:49:53,352 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2019-01-12 00:49:53,353 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse4 (= ~a17~0 1)) (.cse2 (<= ~a17~0 0)) (.cse1 (= ~a16~0 4)) (.cse0 (<= ~a21~0 0)) (.cse3 (not (= ~a7~0 1))) (.cse7 (= ~a16~0 6)) (.cse5 (= ~a21~0 1)) (.cse6 (not (= ~a8~0 13)))) (or (and .cse0 .cse1 .cse2) (and .cse3 .cse4 .cse5) (and .cse0 .cse4) (and .cse4 (= ~a20~0 1) .cse5) (and .cse1 .cse2 .cse5 .cse6) (and .cse3 .cse1 .cse5) (and .cse0 .cse7) (and .cse3 .cse5 .cse7 .cse6) (and .cse5 .cse6 (= ~a16~0 5)))) [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2019-01-12 00:49:53,354 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2019-01-12 00:49:53,355 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,356 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2019-01-12 00:49:53,357 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2019-01-12 00:49:53,358 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2019-01-12 00:49:53,359 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2019-01-12 00:49:53,360 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2019-01-12 00:49:53,361 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2019-01-12 00:49:53,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:49:53 BoogieIcfgContainer [2019-01-12 00:49:53,406 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:49:53,406 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:49:53,407 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:49:53,407 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:49:53,409 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:49:29" (3/4) ... [2019-01-12 00:49:53,417 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:49:53,453 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:49:53,454 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:49:53,668 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:49:53,673 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:49:53,674 INFO L168 Benchmark]: Toolchain (without parser) took 28321.25 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 370.1 MB). Free memory was 952.7 MB in the beginning and 916.4 MB in the end (delta: 36.2 MB). Peak memory consumption was 406.4 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,676 INFO L168 Benchmark]: CDTParser took 0.15 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:49:53,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 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:49:53,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 184.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -210.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,677 INFO L168 Benchmark]: Boogie Preprocessor took 97.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,678 INFO L168 Benchmark]: RCFGBuilder took 2852.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,681 INFO L168 Benchmark]: TraceAbstraction took 24173.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.0 GB in the beginning and 937.9 MB in the end (delta: 75.7 MB). Peak memory consumption was 302.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,682 INFO L168 Benchmark]: Witness Printer took 266.74 ms. Allocated memory is still 1.4 GB. Free memory was 937.9 MB in the beginning and 916.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:49:53,687 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.15 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 740.11 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 920.5 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 184.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -210.0 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 97.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2852.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.2 MB). Peak memory consumption was 110.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24173.81 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 227.0 MB). Free memory was 1.0 GB in the beginning and 937.9 MB in the end (delta: 75.7 MB). Peak memory consumption was 302.8 MB. Max. memory is 11.5 GB. * Witness Printer took 266.74 ms. Allocated memory is still 1.4 GB. Free memory was 937.9 MB in the beginning and 916.4 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 446]: 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: (((((((((a21 <= 0 && a16 == 4) && a17 <= 0) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a16 == 4) && a21 == 1)) || (a21 <= 0 && a16 == 6)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && !(a8 == 13))) || ((a21 == 1 && !(a8 == 13)) && a16 == 5) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((a21 <= 0 && a16 == 4) && a17 <= 0) || ((!(a7 == 1) && a17 == 1) && a21 == 1)) || (a21 <= 0 && a17 == 1)) || ((a17 == 1 && a20 == 1) && a21 == 1)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && !(a8 == 13))) || ((!(a7 == 1) && a16 == 4) && a21 == 1)) || (a21 <= 0 && a16 == 6)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && !(a8 == 13))) || ((a21 == 1 && !(a8 == 13)) && a16 == 5) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 24.0s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 17.6s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 930 SDtfs, 2193 SDslu, 141 SDs, 0 SdLazy, 6625 SolverSat, 1044 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 288 GetRequests, 257 SyntacticMatches, 6 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2231occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 2702 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 34 NumberOfFragments, 195 HoareAnnotationTreeSize, 3 FomulaSimplifications, 16227 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 3 FomulaSimplificationsInter, 3295 FormulaSimplificationTreeSizeReductionInter, 1.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2131 NumberOfCodeBlocks, 2131 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2118 ConstructedInterpolants, 0 QuantifiedInterpolants, 907396 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 13 InterpolantComputations, 12 PerfectInterpolantSequences, 1826/1830 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...