./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label25_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label25_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23f7450b399d10b1ac0a8f247ff41c3f7806d83a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 03:31:03,317 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:31:03,319 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:31:03,331 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:31:03,332 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:31:03,333 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:31:03,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:31:03,336 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:31:03,338 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:31:03,339 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:31:03,340 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:31:03,340 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:31:03,342 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:31:03,342 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:31:03,344 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:31:03,345 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:31:03,346 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:31:03,348 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:31:03,350 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:31:03,351 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:31:03,353 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:31:03,354 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:31:03,357 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:31:03,357 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:31:03,357 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:31:03,358 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:31:03,360 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:31:03,361 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:31:03,362 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:31:03,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:31:03,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:31:03,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:31:03,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:31:03,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:31:03,366 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:31:03,367 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:31:03,367 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:31:03,383 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:31:03,384 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:31:03,385 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:31:03,385 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:31:03,385 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:31:03,386 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:31:03,386 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:31:03,387 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:31:03,388 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:31:03,389 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:31:03,389 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:31:03,389 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:31:03,389 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:31:03,389 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:31:03,389 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:31:03,390 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:31:03,391 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:31:03,391 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:31:03,391 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:31:03,391 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:31:03,391 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:31:03,392 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:31:03,392 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:31:03,392 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 -> 23f7450b399d10b1ac0a8f247ff41c3f7806d83a [2019-01-12 03:31:03,429 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:31:03,450 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:31:03,457 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:31:03,458 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:31:03,459 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:31:03,460 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label25_true-unreach-call.c [2019-01-12 03:31:03,524 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8867d75/6d8974255b6b4d6f839788eedf7c06ab/FLAGff02a5945 [2019-01-12 03:31:04,083 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:31:04,084 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label25_true-unreach-call.c [2019-01-12 03:31:04,100 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8867d75/6d8974255b6b4d6f839788eedf7c06ab/FLAGff02a5945 [2019-01-12 03:31:04,348 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ba8867d75/6d8974255b6b4d6f839788eedf7c06ab [2019-01-12 03:31:04,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:31:04,354 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:31:04,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:31:04,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:31:04,360 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:31:04,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:31:04" (1/1) ... [2019-01-12 03:31:04,365 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1944673d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:04, skipping insertion in model container [2019-01-12 03:31:04,365 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:31:04" (1/1) ... [2019-01-12 03:31:04,375 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:31:04,449 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:31:04,928 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:31:04,934 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:31:05,047 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:31:05,071 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:31:05,072 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05 WrapperNode [2019-01-12 03:31:05,072 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:31:05,074 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:31:05,074 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:31:05,074 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:31:05,171 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,197 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,268 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:31:05,268 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:31:05,268 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:31:05,268 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:31:05,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,280 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,287 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,288 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,360 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (1/1) ... [2019-01-12 03:31:05,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:31:05,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:31:05,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:31:05,402 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:31:05,405 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (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 03:31:05,485 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:31:05,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:31:08,693 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:31:08,694 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:31:08,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:08 BoogieIcfgContainer [2019-01-12 03:31:08,695 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:31:08,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:31:08,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:31:08,701 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:31:08,701 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:31:04" (1/3) ... [2019-01-12 03:31:08,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b4f09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:31:08, skipping insertion in model container [2019-01-12 03:31:08,702 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:31:05" (2/3) ... [2019-01-12 03:31:08,702 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b4f09f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:31:08, skipping insertion in model container [2019-01-12 03:31:08,703 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:08" (3/3) ... [2019-01-12 03:31:08,706 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label25_true-unreach-call.c [2019-01-12 03:31:08,716 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:31:08,724 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:31:08,740 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:31:08,775 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:31:08,776 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:31:08,777 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:31:08,777 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:31:08,777 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:31:08,778 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:31:08,778 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:31:08,778 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:31:08,778 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:31:08,802 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:31:08,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-01-12 03:31:08,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:08,816 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] [2019-01-12 03:31:08,819 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:08,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:08,828 INFO L82 PathProgramCache]: Analyzing trace with hash -107486446, now seen corresponding path program 1 times [2019-01-12 03:31:08,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:08,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:08,877 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:08,877 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:08,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:08,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:09,472 WARN L181 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 19 DAG size of output: 15 [2019-01-12 03:31:09,664 WARN L181 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 17 [2019-01-12 03:31:09,858 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 03:31:09,861 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:31:09,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-01-12 03:31:09,867 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:31:09,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:31:09,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:31:09,882 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 7 states. [2019-01-12 03:31:14,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:14,280 INFO L93 Difference]: Finished difference Result 982 states and 1810 transitions. [2019-01-12 03:31:14,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:31:14,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-01-12 03:31:14,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:14,320 INFO L225 Difference]: With dead ends: 982 [2019-01-12 03:31:14,320 INFO L226 Difference]: Without dead ends: 699 [2019-01-12 03:31:14,325 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:31:14,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2019-01-12 03:31:14,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 421. [2019-01-12 03:31:14,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:31:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 581 transitions. [2019-01-12 03:31:14,401 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 581 transitions. Word has length 64 [2019-01-12 03:31:14,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:14,401 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 581 transitions. [2019-01-12 03:31:14,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:31:14,402 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 581 transitions. [2019-01-12 03:31:14,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2019-01-12 03:31:14,410 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:14,412 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:31:14,412 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:14,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:14,413 INFO L82 PathProgramCache]: Analyzing trace with hash 993821404, now seen corresponding path program 1 times [2019-01-12 03:31:14,413 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:14,413 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:14,414 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:14,415 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:14,415 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:14,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:14,707 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:31:14,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:31:14,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:31:14,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:31:14,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:31:14,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:31:14,711 INFO L87 Difference]: Start difference. First operand 421 states and 581 transitions. Second operand 4 states. [2019-01-12 03:31:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:15,971 INFO L93 Difference]: Finished difference Result 1257 states and 1737 transitions. [2019-01-12 03:31:15,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:31:15,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 182 [2019-01-12 03:31:15,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:15,978 INFO L225 Difference]: With dead ends: 1257 [2019-01-12 03:31:15,978 INFO L226 Difference]: Without dead ends: 838 [2019-01-12 03:31:15,980 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:31:15,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 838 states. [2019-01-12 03:31:16,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 838 to 699. [2019-01-12 03:31:16,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:31:16,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 889 transitions. [2019-01-12 03:31:16,025 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 889 transitions. Word has length 182 [2019-01-12 03:31:16,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:16,031 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 889 transitions. [2019-01-12 03:31:16,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:31:16,031 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 889 transitions. [2019-01-12 03:31:16,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2019-01-12 03:31:16,039 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:16,039 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:31:16,040 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:16,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:16,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1850496052, now seen corresponding path program 1 times [2019-01-12 03:31:16,040 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:16,040 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:16,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:16,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:16,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:16,415 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:31:16,415 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:31:16,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:31:16,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:31:16,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:31:16,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:31:16,417 INFO L87 Difference]: Start difference. First operand 699 states and 889 transitions. Second operand 4 states. [2019-01-12 03:31:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:18,690 INFO L93 Difference]: Finished difference Result 1674 states and 2200 transitions. [2019-01-12 03:31:18,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:31:18,693 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 208 [2019-01-12 03:31:18,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:18,700 INFO L225 Difference]: With dead ends: 1674 [2019-01-12 03:31:18,700 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:31:18,702 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 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 03:31:18,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:31:18,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 977. [2019-01-12 03:31:18,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:31:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1197 transitions. [2019-01-12 03:31:18,728 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1197 transitions. Word has length 208 [2019-01-12 03:31:18,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:18,729 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1197 transitions. [2019-01-12 03:31:18,729 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:31:18,729 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1197 transitions. [2019-01-12 03:31:18,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-01-12 03:31:18,735 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:18,736 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:31:18,736 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:18,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:18,737 INFO L82 PathProgramCache]: Analyzing trace with hash -537096852, now seen corresponding path program 1 times [2019-01-12 03:31:18,737 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:18,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:18,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:18,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:18,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 411 backedges. 349 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 03:31:18,996 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:31:18,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:31:18,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:31:18,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:31:18,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:31:18,997 INFO L87 Difference]: Start difference. First operand 977 states and 1197 transitions. Second operand 3 states. [2019-01-12 03:31:19,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:19,881 INFO L93 Difference]: Finished difference Result 2230 states and 2765 transitions. [2019-01-12 03:31:19,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:31:19,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 300 [2019-01-12 03:31:19,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:19,891 INFO L225 Difference]: With dead ends: 2230 [2019-01-12 03:31:19,891 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:31:19,893 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 03:31:19,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:31:19,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:31:19,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:31:19,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1170 transitions. [2019-01-12 03:31:19,923 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1170 transitions. Word has length 300 [2019-01-12 03:31:19,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:19,923 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1170 transitions. [2019-01-12 03:31:19,924 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:31:19,924 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1170 transitions. [2019-01-12 03:31:19,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-01-12 03:31:19,931 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:19,932 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:31:19,932 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:19,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:19,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1075041914, now seen corresponding path program 1 times [2019-01-12 03:31:19,933 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:19,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:19,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:19,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:19,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:20,646 WARN L181 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 9 [2019-01-12 03:31:20,937 WARN L181 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 9 [2019-01-12 03:31:21,038 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 282 proven. 78 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 03:31:21,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:31:21,039 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 03:31:21,050 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:21,197 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:31:21,426 WARN L181 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-01-12 03:31:22,350 WARN L181 SmtUtils]: Spent 303.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 27 [2019-01-12 03:31:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 296 proven. 64 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2019-01-12 03:31:22,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:31:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2019-01-12 03:31:22,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:31:22,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:31:22,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:31:22,967 INFO L87 Difference]: Start difference. First operand 977 states and 1170 transitions. Second operand 10 states. [2019-01-12 03:31:29,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:29,386 INFO L93 Difference]: Finished difference Result 3816 states and 4696 transitions. [2019-01-12 03:31:29,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-01-12 03:31:29,388 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 336 [2019-01-12 03:31:29,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:29,402 INFO L225 Difference]: With dead ends: 3816 [2019-01-12 03:31:29,402 INFO L226 Difference]: Without dead ends: 2980 [2019-01-12 03:31:29,405 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=353, Unknown=0, NotChecked=0, Total=506 [2019-01-12 03:31:29,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2980 states. [2019-01-12 03:31:29,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2980 to 2089. [2019-01-12 03:31:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-01-12 03:31:29,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2376 transitions. [2019-01-12 03:31:29,462 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2376 transitions. Word has length 336 [2019-01-12 03:31:29,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:29,463 INFO L480 AbstractCegarLoop]: Abstraction has 2089 states and 2376 transitions. [2019-01-12 03:31:29,463 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:31:29,463 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2376 transitions. [2019-01-12 03:31:29,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2019-01-12 03:31:29,472 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:29,472 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:31:29,473 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:29,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:29,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1347480026, now seen corresponding path program 1 times [2019-01-12 03:31:29,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:29,474 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:29,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:29,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:29,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:29,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:29,945 WARN L181 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 03:31:30,079 INFO L134 CoverageAnalysis]: Checked inductivity of 422 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2019-01-12 03:31:30,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:31:30,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:31:30,082 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:31:30,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:31:30,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:31:30,086 INFO L87 Difference]: Start difference. First operand 2089 states and 2376 transitions. Second operand 4 states. [2019-01-12 03:31:31,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:31,698 INFO L93 Difference]: Finished difference Result 5427 states and 6266 transitions. [2019-01-12 03:31:31,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:31:31,699 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 355 [2019-01-12 03:31:31,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:31,715 INFO L225 Difference]: With dead ends: 5427 [2019-01-12 03:31:31,716 INFO L226 Difference]: Without dead ends: 3479 [2019-01-12 03:31:31,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 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 03:31:31,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2019-01-12 03:31:31,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3062. [2019-01-12 03:31:31,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3062 states. [2019-01-12 03:31:31,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3062 states to 3062 states and 3523 transitions. [2019-01-12 03:31:31,795 INFO L78 Accepts]: Start accepts. Automaton has 3062 states and 3523 transitions. Word has length 355 [2019-01-12 03:31:31,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:31,796 INFO L480 AbstractCegarLoop]: Abstraction has 3062 states and 3523 transitions. [2019-01-12 03:31:31,796 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:31:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 3062 states and 3523 transitions. [2019-01-12 03:31:31,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2019-01-12 03:31:31,815 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:31:31,816 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:31:31,816 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:31:31,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:31:31,816 INFO L82 PathProgramCache]: Analyzing trace with hash 354597640, now seen corresponding path program 1 times [2019-01-12 03:31:31,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:31:31,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:31:31,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:31,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:31,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:31:31,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:32,660 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 137 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:31:32,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:31:32,661 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:31:32,674 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:31:32,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:31:32,770 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:31:33,126 WARN L181 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 15 [2019-01-12 03:31:33,849 INFO L134 CoverageAnalysis]: Checked inductivity of 455 backedges. 137 proven. 318 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:31:33,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:31:33,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 9 [2019-01-12 03:31:33,870 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-12 03:31:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-12 03:31:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:31:33,872 INFO L87 Difference]: Start difference. First operand 3062 states and 3523 transitions. Second operand 10 states. [2019-01-12 03:31:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:31:39,390 INFO L93 Difference]: Finished difference Result 9178 states and 10577 transitions. [2019-01-12 03:31:39,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 03:31:39,391 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 392 [2019-01-12 03:31:39,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:31:39,393 INFO L225 Difference]: With dead ends: 9178 [2019-01-12 03:31:39,393 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:31:39,404 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 389 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-01-12 03:31:39,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:31:39,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:31:39,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:31:39,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:31:39,406 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 392 [2019-01-12 03:31:39,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:31:39,406 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:31:39,406 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-12 03:31:39,407 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:31:39,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:31:39,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:31:39,509 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,518 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,550 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,562 WARN L181 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 131 [2019-01-12 03:31:39,648 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,658 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,704 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:31:39,722 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 131 [2019-01-12 03:31:41,330 WARN L181 SmtUtils]: Spent 1.60 s on a formula simplification. DAG size of input: 131 DAG size of output: 50 [2019-01-12 03:31:41,984 WARN L181 SmtUtils]: Spent 650.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 50 [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,989 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:31:41,990 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:31:41,991 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:31:41,992 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:31:41,993 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:31:41,994 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 7))) (.cse2 (and (= ~a10~0 1) (< 0 (+ ~a1~0 13))))) (or (and .cse0 (not (= 4 ~a10~0))) (and (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse1 (mod v_prenex_33 299890))) (and (<= 110 v_prenex_34) (<= 0 v_prenex_34) (<= (+ .cse1 221) ~a1~0) (not (= 0 .cse1)) (<= v_prenex_34 198) (< v_prenex_33 0) (<= (+ v_prenex_33 523690) (div v_prenex_34 5))))) .cse2) (and .cse0 (not (= ~a19~0 10))) (and .cse2 (<= ~a1~0 33)) (= ~a10~0 2))) [2019-01-12 03:31:41,994 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:31:41,994 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:31:41,994 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:31:41,994 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:31:41,994 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:31:41,995 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,996 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:31:41,997 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:31:41,998 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:31:41,999 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a19~0 7))) (.cse2 (and (= ~a10~0 1) (< 0 (+ ~a1~0 13))))) (or (and .cse0 (not (= 4 ~a10~0))) (and (exists ((v_prenex_34 Int) (v_prenex_33 Int)) (let ((.cse1 (mod v_prenex_33 299890))) (and (<= 110 v_prenex_34) (<= 0 v_prenex_34) (<= (+ .cse1 221) ~a1~0) (not (= 0 .cse1)) (<= v_prenex_34 198) (< v_prenex_33 0) (<= (+ v_prenex_33 523690) (div v_prenex_34 5))))) .cse2) (and .cse0 (not (= ~a19~0 10))) (and .cse2 (<= ~a1~0 33)) (= ~a10~0 2))) [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,000 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:31:42,001 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,002 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:31:42,003 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,004 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:31:42,005 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:31:42,006 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 196) no Hoare annotation was computed. [2019-01-12 03:31:42,007 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:31:42,008 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:31:42,009 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:31:42,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,019 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,020 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,031 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,032 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,037 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,038 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,039 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,041 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,042 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,043 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,047 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:31:42 BoogieIcfgContainer [2019-01-12 03:31:42,053 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:31:42,054 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:31:42,054 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:31:42,055 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:31:42,055 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:31:08" (3/4) ... [2019-01-12 03:31:42,060 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:31:42,097 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:31:42,098 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:31:42,143 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(a19 == 7) && !(4 == a10)) || ((\exists v_prenex_34 : int, v_prenex_33 : int :: (((((110 <= v_prenex_34 && 0 <= v_prenex_34) && v_prenex_33 % 299890 + 221 <= a1) && !(0 == v_prenex_33 % 299890)) && v_prenex_34 <= 198) && v_prenex_33 < 0) && v_prenex_33 + 523690 <= v_prenex_34 / 5) && a10 == 1 && 0 < a1 + 13)) || (!(a19 == 7) && !(a19 == 10))) || ((a10 == 1 && 0 < a1 + 13) && a1 <= 33)) || a10 == 2 [2019-01-12 03:31:42,149 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(a19 == 7) && !(4 == a10)) || ((\exists v_prenex_34 : int, v_prenex_33 : int :: (((((110 <= v_prenex_34 && 0 <= v_prenex_34) && v_prenex_33 % 299890 + 221 <= a1) && !(0 == v_prenex_33 % 299890)) && v_prenex_34 <= 198) && v_prenex_33 < 0) && v_prenex_33 + 523690 <= v_prenex_34 / 5) && a10 == 1 && 0 < a1 + 13)) || (!(a19 == 7) && !(a19 == 10))) || ((a10 == 1 && 0 < a1 + 13) && a1 <= 33)) || a10 == 2 [2019-01-12 03:31:42,335 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:31:42,339 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:31:42,341 INFO L168 Benchmark]: Toolchain (without parser) took 37987.85 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 612.9 MB). Free memory was 952.7 MB in the beginning and 1.5 GB in the end (delta: -498.3 MB). Peak memory consumption was 114.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:31:42,343 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 03:31:42,343 INFO L168 Benchmark]: CACSL2BoogieTranslator took 716.36 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 03:31:42,344 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:31:42,344 INFO L168 Benchmark]: Boogie Preprocessor took 133.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:31:42,345 INFO L168 Benchmark]: RCFGBuilder took 3293.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 114.0 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. [2019-01-12 03:31:42,346 INFO L168 Benchmark]: TraceAbstraction took 33356.12 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 482.3 MB). Free memory was 996.5 MB in the beginning and 1.5 GB in the end (delta: -471.3 MB). Peak memory consumption was 590.1 MB. Max. memory is 11.5 GB. [2019-01-12 03:31:42,346 INFO L168 Benchmark]: Witness Printer took 285.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:31:42,350 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 716.36 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 194.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 920.5 MB in the beginning and 1.1 GB in the end (delta: -190.0 MB). Peak memory consumption was 16.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 133.59 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3293.30 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 996.5 MB in the end (delta: 114.0 MB). Peak memory consumption was 114.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 33356.12 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 482.3 MB). Free memory was 996.5 MB in the beginning and 1.5 GB in the end (delta: -471.3 MB). Peak memory consumption was 590.1 MB. Max. memory is 11.5 GB. * Witness Printer took 285.60 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 196]: 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: 582]: Loop Invariant [2019-01-12 03:31:42,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,365 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,366 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,369 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,370 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] Derived loop invariant: ((((!(a19 == 7) && !(4 == a10)) || ((\exists v_prenex_34 : int, v_prenex_33 : int :: (((((110 <= v_prenex_34 && 0 <= v_prenex_34) && v_prenex_33 % 299890 + 221 <= a1) && !(0 == v_prenex_33 % 299890)) && v_prenex_34 <= 198) && v_prenex_33 < 0) && v_prenex_33 + 523690 <= v_prenex_34 / 5) && a10 == 1 && 0 < a1 + 13)) || (!(a19 == 7) && !(a19 == 10))) || ((a10 == 1 && 0 < a1 + 13) && a1 <= 33)) || a10 == 2 - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 03:31:42,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,378 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,379 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,384 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] [2019-01-12 03:31:42,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_33,QUANTIFIED] [2019-01-12 03:31:42,386 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_34,QUANTIFIED] Derived loop invariant: ((((!(a19 == 7) && !(4 == a10)) || ((\exists v_prenex_34 : int, v_prenex_33 : int :: (((((110 <= v_prenex_34 && 0 <= v_prenex_34) && v_prenex_33 % 299890 + 221 <= a1) && !(0 == v_prenex_33 % 299890)) && v_prenex_34 <= 198) && v_prenex_33 < 0) && v_prenex_33 + 523690 <= v_prenex_34 / 5) && a10 == 1 && 0 < a1 + 13)) || (!(a19 == 7) && !(a19 == 10))) || ((a10 == 1 && 0 < a1 + 13) && a1 <= 33)) || a10 == 2 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 33.2s OverallTime, 7 OverallIterations, 4 TraceHistogramMax, 22.5s AutomataDifference, 0.0s DeadEndRemovalTime, 2.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 441 SDtfs, 3996 SDslu, 204 SDs, 0 SdLazy, 10201 SolverSat, 1679 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 781 GetRequests, 729 SyntacticMatches, 8 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 3.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3062occurred in iteration=6, 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.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 1864 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 104 NumberOfFragments, 159 HoareAnnotationTreeSize, 3 FomulaSimplifications, 7140 FormulaSimplificationTreeSizeReduction, 0.3s HoareSimplificationTime, 3 FomulaSimplificationsInter, 5850 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2565 NumberOfCodeBlocks, 2565 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2556 ConstructedInterpolants, 261 QuantifiedInterpolants, 5480813 SizeOfPredicates, 7 NumberOfNonLiveVariables, 964 ConjunctsInSsa, 22 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 2058/2836 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...