./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbfe8dec550fadf4da01fadd46005a09263b3b04 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:54:37,184 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:54:37,186 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:54:37,198 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:54:37,198 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:54:37,199 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:54:37,201 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:54:37,203 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:54:37,204 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:54:37,205 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:54:37,206 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:54:37,207 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:54:37,208 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:54:37,209 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:54:37,210 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:54:37,211 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:54:37,212 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:54:37,215 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:54:37,224 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:54:37,226 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:54:37,227 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:54:37,234 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:54:37,239 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:54:37,239 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:54:37,239 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:54:37,240 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:54:37,244 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:54:37,244 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:54:37,245 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:54:37,250 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:54:37,251 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:54:37,253 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:54:37,253 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:54:37,253 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:54:37,256 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:54:37,257 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:54:37,257 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:54:37,291 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:54:37,292 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:54:37,295 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:54:37,295 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:54:37,295 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:54:37,296 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:54:37,296 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:54:37,296 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:54:37,296 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:54:37,296 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:54:37,296 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:54:37,297 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:54:37,299 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:54:37,299 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:54:37,299 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:54:37,299 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:54:37,300 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:54:37,300 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:54:37,300 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:54:37,300 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:54:37,301 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:54:37,301 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:54:37,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:54:37,301 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 -> fbfe8dec550fadf4da01fadd46005a09263b3b04 [2019-01-12 00:54:37,342 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:54:37,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:54:37,359 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:54:37,362 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:54:37,363 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:54:37,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2019-01-12 00:54:37,419 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca599051b/7804632248b742d1847283e253ff3737/FLAG3475ceabf [2019-01-12 00:54:37,921 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:54:37,927 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2019-01-12 00:54:37,939 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca599051b/7804632248b742d1847283e253ff3737/FLAG3475ceabf [2019-01-12 00:54:38,202 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca599051b/7804632248b742d1847283e253ff3737 [2019-01-12 00:54:38,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:54:38,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:54:38,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:38,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:54:38,214 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:54:38,215 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a290a6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38, skipping insertion in model container [2019-01-12 00:54:38,218 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:38,227 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:54:38,280 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:54:38,770 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:38,776 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:54:38,889 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:54:38,917 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:54:38,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38 WrapperNode [2019-01-12 00:54:38,917 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:54:38,919 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:38,919 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:54:38,919 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:54:38,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,035 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,101 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:54:39,102 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:54:39,102 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:54:39,102 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:54:39,110 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,110 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,117 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,117 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,157 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,193 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... [2019-01-12 00:54:39,201 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:54:39,202 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:54:39,202 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:54:39,202 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:54:39,203 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:54:39,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:54:39,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:54:42,455 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:54:42,456 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:54:42,457 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:42 BoogieIcfgContainer [2019-01-12 00:54:42,458 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:54:42,460 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:54:42,460 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:54:42,464 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:54:42,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:54:38" (1/3) ... [2019-01-12 00:54:42,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fff97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:42, skipping insertion in model container [2019-01-12 00:54:42,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:54:38" (2/3) ... [2019-01-12 00:54:42,466 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55fff97d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:54:42, skipping insertion in model container [2019-01-12 00:54:42,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:42" (3/3) ... [2019-01-12 00:54:42,469 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label04_true-unreach-call_false-termination.c [2019-01-12 00:54:42,481 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:54:42,493 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:54:42,514 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:54:42,550 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:54:42,551 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:54:42,551 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:54:42,552 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:54:42,552 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:54:42,552 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:54:42,552 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:54:42,553 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:54:42,553 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:54:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:54:42,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-01-12 00:54:42,592 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:42,593 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:42,596 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:42,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:42,604 INFO L82 PathProgramCache]: Analyzing trace with hash 585738029, now seen corresponding path program 1 times [2019-01-12 00:54:42,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:42,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:42,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:42,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:42,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:42,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:43,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:43,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:43,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:43,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:43,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:43,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:43,333 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:54:45,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:45,854 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-01-12 00:54:45,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:45,857 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 106 [2019-01-12 00:54:45,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:45,876 INFO L225 Difference]: With dead ends: 739 [2019-01-12 00:54:45,876 INFO L226 Difference]: Without dead ends: 445 [2019-01-12 00:54:45,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:45,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-01-12 00:54:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-01-12 00:54:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-01-12 00:54:45,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-01-12 00:54:45,990 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 106 [2019-01-12 00:54:45,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:45,991 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-01-12 00:54:45,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:45,992 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-01-12 00:54:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2019-01-12 00:54:45,999 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:45,999 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:45,999 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:46,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:46,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1744926738, now seen corresponding path program 1 times [2019-01-12 00:54:46,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:46,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:46,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:46,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:46,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:46,131 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:46,132 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:46,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:46,134 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:46,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:46,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:46,136 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-01-12 00:54:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:47,578 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-01-12 00:54:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:47,579 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 124 [2019-01-12 00:54:47,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:47,585 INFO L225 Difference]: With dead ends: 1470 [2019-01-12 00:54:47,586 INFO L226 Difference]: Without dead ends: 1027 [2019-01-12 00:54:47,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:47,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-01-12 00:54:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-01-12 00:54:47,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-01-12 00:54:47,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-01-12 00:54:47,646 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 124 [2019-01-12 00:54:47,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:47,646 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-01-12 00:54:47,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:47,647 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-01-12 00:54:47,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 00:54:47,653 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:47,654 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:47,654 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:47,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:47,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1686692647, now seen corresponding path program 1 times [2019-01-12 00:54:47,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:47,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:47,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:47,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:47,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:47,966 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:47,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:47,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:47,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:47,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:47,969 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-01-12 00:54:50,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:50,963 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-01-12 00:54:50,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:54:50,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 128 [2019-01-12 00:54:50,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:50,978 INFO L225 Difference]: With dead ends: 2582 [2019-01-12 00:54:50,979 INFO L226 Difference]: Without dead ends: 1855 [2019-01-12 00:54:50,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:50,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-01-12 00:54:51,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-01-12 00:54:51,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-01-12 00:54:51,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2142 transitions. [2019-01-12 00:54:51,043 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2142 transitions. Word has length 128 [2019-01-12 00:54:51,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:51,045 INFO L480 AbstractCegarLoop]: Abstraction has 1570 states and 2142 transitions. [2019-01-12 00:54:51,046 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:51,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2142 transitions. [2019-01-12 00:54:51,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-01-12 00:54:51,051 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:51,052 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:51,052 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:51,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:51,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1700654884, now seen corresponding path program 1 times [2019-01-12 00:54:51,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:51,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:51,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:51,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:51,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:51,174 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:51,174 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:51,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:54:51,175 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:51,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:51,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:51,177 INFO L87 Difference]: Start difference. First operand 1570 states and 2142 transitions. Second operand 3 states. [2019-01-12 00:54:51,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:51,788 INFO L93 Difference]: Finished difference Result 3840 states and 5195 transitions. [2019-01-12 00:54:51,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:51,788 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 128 [2019-01-12 00:54:51,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:51,800 INFO L225 Difference]: With dead ends: 3840 [2019-01-12 00:54:51,800 INFO L226 Difference]: Without dead ends: 2272 [2019-01-12 00:54:51,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:51,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-01-12 00:54:51,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2019-01-12 00:54:51,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-01-12 00:54:51,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2839 transitions. [2019-01-12 00:54:51,850 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2839 transitions. Word has length 128 [2019-01-12 00:54:51,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:51,851 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 2839 transitions. [2019-01-12 00:54:51,851 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:51,851 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2839 transitions. [2019-01-12 00:54:51,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-01-12 00:54:51,855 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:51,856 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:51,856 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:51,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:51,857 INFO L82 PathProgramCache]: Analyzing trace with hash -1927886609, now seen corresponding path program 1 times [2019-01-12 00:54:51,857 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:51,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:51,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:51,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:51,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:51,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:54:52,043 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:52,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:54:52,044 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:54:52,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:54:52,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:52,046 INFO L87 Difference]: Start difference. First operand 2272 states and 2839 transitions. Second operand 4 states. [2019-01-12 00:54:52,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:52,827 INFO L93 Difference]: Finished difference Result 4542 states and 5676 transitions. [2019-01-12 00:54:52,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:52,828 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 133 [2019-01-12 00:54:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:52,838 INFO L225 Difference]: With dead ends: 4542 [2019-01-12 00:54:52,838 INFO L226 Difference]: Without dead ends: 2272 [2019-01-12 00:54:52,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:54:52,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-01-12 00:54:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 1852. [2019-01-12 00:54:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2019-01-12 00:54:52,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2236 transitions. [2019-01-12 00:54:52,881 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2236 transitions. Word has length 133 [2019-01-12 00:54:52,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:52,881 INFO L480 AbstractCegarLoop]: Abstraction has 1852 states and 2236 transitions. [2019-01-12 00:54:52,882 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:54:52,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2236 transitions. [2019-01-12 00:54:52,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-01-12 00:54:52,887 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:52,887 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:54:52,887 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:52,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1580571441, now seen corresponding path program 1 times [2019-01-12 00:54:52,888 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:52,888 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:52,889 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:52,889 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:52,976 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:54:52,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:52,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:52,977 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:52,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:52,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:52,978 INFO L87 Difference]: Start difference. First operand 1852 states and 2236 transitions. Second operand 3 states. [2019-01-12 00:54:53,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:53,911 INFO L93 Difference]: Finished difference Result 3987 states and 4778 transitions. [2019-01-12 00:54:53,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:53,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-01-12 00:54:53,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:53,921 INFO L225 Difference]: With dead ends: 3987 [2019-01-12 00:54:53,921 INFO L226 Difference]: Without dead ends: 2137 [2019-01-12 00:54:53,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:53,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2137 states. [2019-01-12 00:54:53,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2137 to 1992. [2019-01-12 00:54:53,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1992 states. [2019-01-12 00:54:53,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1992 states to 1992 states and 2277 transitions. [2019-01-12 00:54:53,963 INFO L78 Accepts]: Start accepts. Automaton has 1992 states and 2277 transitions. Word has length 146 [2019-01-12 00:54:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:53,963 INFO L480 AbstractCegarLoop]: Abstraction has 1992 states and 2277 transitions. [2019-01-12 00:54:53,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 1992 states and 2277 transitions. [2019-01-12 00:54:53,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-01-12 00:54:53,970 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:53,970 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:54:53,971 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:53,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:53,971 INFO L82 PathProgramCache]: Analyzing trace with hash 97640742, now seen corresponding path program 1 times [2019-01-12 00:54:53,971 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:53,971 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:53,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:53,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:54:54,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:54:54,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:54:54,150 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:54:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:54:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:54,157 INFO L87 Difference]: Start difference. First operand 1992 states and 2277 transitions. Second operand 3 states. [2019-01-12 00:54:55,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:54:55,017 INFO L93 Difference]: Finished difference Result 4678 states and 5318 transitions. [2019-01-12 00:54:55,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:54:55,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 199 [2019-01-12 00:54:55,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:54:55,024 INFO L225 Difference]: With dead ends: 4678 [2019-01-12 00:54:55,025 INFO L226 Difference]: Without dead ends: 1843 [2019-01-12 00:54:55,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:54:55,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2019-01-12 00:54:55,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1703. [2019-01-12 00:54:55,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-01-12 00:54:55,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1868 transitions. [2019-01-12 00:54:55,058 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1868 transitions. Word has length 199 [2019-01-12 00:54:55,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:54:55,059 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 1868 transitions. [2019-01-12 00:54:55,059 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:54:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1868 transitions. [2019-01-12 00:54:55,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-01-12 00:54:55,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:54:55,065 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 00:54:55,065 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:54:55,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:54:55,066 INFO L82 PathProgramCache]: Analyzing trace with hash -567770269, now seen corresponding path program 1 times [2019-01-12 00:54:55,066 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:54:55,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:54:55,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:55,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:55,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:54:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:55,250 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-01-12 00:54:55,476 WARN L181 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 00:54:55,706 WARN L181 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:54:55,777 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 85 proven. 3 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-01-12 00:54:55,778 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:54:55,778 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:54:55,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:54:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:54:55,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:54:56,105 INFO L134 CoverageAnalysis]: Checked inductivity of 152 backedges. 104 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:54:56,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:54:56,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:54:56,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:54:56,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:54:56,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:54:56,141 INFO L87 Difference]: Start difference. First operand 1703 states and 1868 transitions. Second operand 8 states. [2019-01-12 00:54:58,485 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-01-12 00:55:00,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:00,878 INFO L93 Difference]: Finished difference Result 4000 states and 4374 transitions. [2019-01-12 00:55:00,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 00:55:00,879 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-01-12 00:55:00,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:00,879 INFO L225 Difference]: With dead ends: 4000 [2019-01-12 00:55:00,879 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:55:00,883 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:55:00,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:55:00,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:55:00,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:55:00,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:55:00,884 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 213 [2019-01-12 00:55:00,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:00,884 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:55:00,885 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:55:00,885 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:55:00,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:55:00,891 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:55:00,927 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:00,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:55:01,916 WARN L181 SmtUtils]: Spent 884.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-01-12 00:55:02,224 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 36 [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:55:02,227 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:55:02,228 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:55:02,229 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:55:02,230 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:55:02,231 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:55:02,232 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:55:02,233 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:55:02,234 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:55:02,235 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:55:02,236 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:55:02,237 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:55:02,238 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse2 (= ~a21~0 1)) (.cse1 (= ~a25~0 1)) (.cse9 (<= 10 ~a28~0)) (.cse7 (<= ~a19~0 0)) (.cse5 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 9)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse3 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse4 .cse0 .cse1) (and .cse6 .cse7) (let ((.cse8 (not .cse1))) (or (and .cse7 (and .cse8 .cse4)) (and .cse7 .cse8 .cse5))) (and .cse9 .cse0 .cse1) (and .cse9 .cse0 .cse3) (and .cse7 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse3))) [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:55:02,239 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:55:02,239 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:55:02,240 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:55:02,241 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse2 (= ~a21~0 1)) (.cse1 (= ~a25~0 1)) (.cse9 (<= 10 ~a28~0)) (.cse7 (<= ~a19~0 0)) (.cse5 (not (= ~a28~0 11))) (.cse6 (= ~a28~0 9)) (.cse0 (= ~a19~0 1)) (.cse4 (= ~a17~0 8)) (.cse3 (= ~a11~0 1))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse2 .cse5) (and .cse4 .cse0 .cse1) (and .cse6 .cse7) (let ((.cse8 (not .cse1))) (or (and .cse7 (and .cse8 .cse4)) (and .cse7 .cse8 .cse5))) (and .cse9 .cse0 .cse1) (and .cse9 .cse0 .cse3) (and .cse7 .cse4 .cse5) (and .cse6 .cse0 .cse4 .cse3))) [2019-01-12 00:55:02,241 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:55:02,242 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:55:02,243 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 490) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:55:02,244 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,245 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:55:02,246 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,247 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:55:02,248 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:55:02,249 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:55:02,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:55:02 BoogieIcfgContainer [2019-01-12 00:55:02,271 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:55:02,272 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:55:02,272 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:55:02,272 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:55:02,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:54:42" (3/4) ... [2019-01-12 00:55:02,276 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:55:02,299 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:55:02,300 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:55:02,517 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:55:02,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:55:02,522 INFO L168 Benchmark]: Toolchain (without parser) took 24315.15 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 369.6 MB). Free memory was 937.9 MB in the beginning and 1.2 GB in the end (delta: -212.1 MB). Peak memory consumption was 157.5 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,523 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:55:02,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 708.99 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 909.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 182.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,525 INFO L168 Benchmark]: Boogie Preprocessor took 99.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,526 INFO L168 Benchmark]: RCFGBuilder took 3256.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,526 INFO L168 Benchmark]: TraceAbstraction took 19811.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.5 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,528 INFO L168 Benchmark]: Witness Printer took 249.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. [2019-01-12 00:55:02,531 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.25 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 708.99 ms. Allocated memory is still 1.0 GB. Free memory was 937.9 MB in the beginning and 909.8 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 182.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.9 MB). Free memory was 909.8 MB in the beginning and 1.1 GB in the end (delta: -214.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3256.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 99.9 MB). Peak memory consumption was 99.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 19811.83 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -154.5 MB). Peak memory consumption was 77.2 MB. Max. memory is 11.5 GB. * Witness Printer took 249.49 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.2 MB). Peak memory consumption was 22.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 490]: 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: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && a25 == 1) && a21 == 1) && a11 == 1) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (a19 <= 0 && !(a25 == 1) && a17 == 8) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((a28 == 9 && a19 == 1) && a17 == 8) && a11 == 1) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a19 == 1 && a25 == 1) && a21 == 1) && a11 == 1) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (a19 <= 0 && !(a25 == 1) && a17 == 8) || ((a19 <= 0 && !(a25 == 1)) && !(a28 == 11))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || ((10 <= a28 && a19 == 1) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((a28 == 9 && a19 == 1) && a17 == 8) && a11 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 19.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 15.0s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 1033 SDtfs, 2188 SDslu, 288 SDs, 0 SdLazy, 5619 SolverSat, 972 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 254 GetRequests, 229 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=4, 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.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 78 NumberOfFragments, 229 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1886 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 526 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 1390 NumberOfCodeBlocks, 1390 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1381 ConstructedInterpolants, 0 QuantifiedInterpolants, 493873 SizeOfPredicates, 1 NumberOfNonLiveVariables, 350 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 568/571 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...