./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label00_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem10_label00_true-unreach-call.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0db867b83f4df60c5aafa7e1ef5bcec7ce49962a ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:28:26,215 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:28:26,217 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:28:26,229 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:28:26,230 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:28:26,231 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:28:26,232 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:28:26,235 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:28:26,237 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:28:26,238 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:28:26,239 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:28:26,239 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:28:26,240 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:28:26,241 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:28:26,243 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:28:26,244 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:28:26,245 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:28:26,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:28:26,249 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:28:26,251 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:28:26,253 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:28:26,254 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:28:26,257 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:28:26,258 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:28:26,258 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:28:26,259 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:28:26,261 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:28:26,263 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:28:26,264 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:28:26,265 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:28:26,266 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:28:26,267 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:28:26,267 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:28:26,267 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:28:26,269 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:28:26,270 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:28:26,270 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:28:26,288 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:28:26,288 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:28:26,290 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:28:26,290 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:28:26,290 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:28:26,290 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:28:26,291 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:28:26,291 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:28:26,292 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:28:26,292 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:28:26,292 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:28:26,292 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:28:26,292 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:28:26,293 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:28:26,293 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:28:26,293 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:28:26,293 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:28:26,293 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:28:26,293 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:28:26,294 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:28:26,294 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:28:26,294 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:28:26,294 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:28:26,294 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:28:26,295 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:28:26,295 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:28:26,295 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:28:26,295 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:28:26,295 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 -> 0db867b83f4df60c5aafa7e1ef5bcec7ce49962a [2019-01-12 03:28:26,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:28:26,346 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:28:26,350 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:28:26,351 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:28:26,352 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:28:26,352 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label00_true-unreach-call.c [2019-01-12 03:28:26,410 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0cd0bdd/081f153669aa4dce9f1565c3e8f70971/FLAG73b7076dd [2019-01-12 03:28:26,934 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:28:26,935 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label00_true-unreach-call.c [2019-01-12 03:28:26,951 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0cd0bdd/081f153669aa4dce9f1565c3e8f70971/FLAG73b7076dd [2019-01-12 03:28:27,228 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fb0cd0bdd/081f153669aa4dce9f1565c3e8f70971 [2019-01-12 03:28:27,232 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:28:27,234 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:28:27,235 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:28:27,236 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:28:27,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:28:27,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:27,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7290c9a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27, skipping insertion in model container [2019-01-12 03:28:27,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:27,254 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:28:27,318 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:28:27,764 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:28:27,770 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:28:27,943 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:28:27,966 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:28:27,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27 WrapperNode [2019-01-12 03:28:27,967 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:28:27,968 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:28:27,968 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:28:27,968 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:28:27,975 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,147 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:28:28,147 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:28:28,147 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:28:28,148 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:28:28,158 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,165 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,165 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,219 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... [2019-01-12 03:28:28,237 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:28:28,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:28:28,238 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:28:28,238 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:28:28,239 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:28:28,320 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:28:28,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:28:31,147 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:28:31,147 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:28:31,149 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:28:31 BoogieIcfgContainer [2019-01-12 03:28:31,149 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:28:31,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:28:31,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:28:31,154 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:28:31,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:28:27" (1/3) ... [2019-01-12 03:28:31,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:28:31, skipping insertion in model container [2019-01-12 03:28:31,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:28:27" (2/3) ... [2019-01-12 03:28:31,157 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2098e52a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:28:31, skipping insertion in model container [2019-01-12 03:28:31,157 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:28:31" (3/3) ... [2019-01-12 03:28:31,159 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label00_true-unreach-call.c [2019-01-12 03:28:31,169 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:28:31,180 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:28:31,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:28:31,243 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:28:31,244 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:28:31,245 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:28:31,245 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:28:31,245 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:28:31,246 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:28:31,246 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:28:31,246 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:28:31,246 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:28:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:28:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-12 03:28:31,288 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:31,290 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] [2019-01-12 03:28:31,296 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:31,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:31,303 INFO L82 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2019-01-12 03:28:31,305 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:31,306 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:31,349 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:31,349 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:31,786 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:28:31,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:28:31,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:28:31,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:28:31,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:31,818 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:28:34,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:34,138 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:28:34,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:28:34,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2019-01-12 03:28:34,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:34,158 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:28:34,158 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:28:34,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:28:34,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:28:34,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:28:34,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:28:34,227 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 47 [2019-01-12 03:28:34,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:34,227 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:28:34,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:28:34,228 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:28:34,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2019-01-12 03:28:34,236 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:34,236 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:34,237 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:34,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:34,238 INFO L82 PathProgramCache]: Analyzing trace with hash 469761532, now seen corresponding path program 1 times [2019-01-12 03:28:34,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:34,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:34,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:34,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:34,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:34,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:34,960 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:28:34,960 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:34,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-01-12 03:28:34,962 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:28:34,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:28:34,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:28:34,963 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 8 states. [2019-01-12 03:28:37,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:37,018 INFO L93 Difference]: Finished difference Result 715 states and 1090 transitions. [2019-01-12 03:28:37,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-12 03:28:37,020 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 162 [2019-01-12 03:28:37,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:37,028 INFO L225 Difference]: With dead ends: 715 [2019-01-12 03:28:37,028 INFO L226 Difference]: Without dead ends: 435 [2019-01-12 03:28:37,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:28:37,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2019-01-12 03:28:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 421. [2019-01-12 03:28:37,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:28:37,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 576 transitions. [2019-01-12 03:28:37,088 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 576 transitions. Word has length 162 [2019-01-12 03:28:37,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:37,089 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 576 transitions. [2019-01-12 03:28:37,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:28:37,089 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 576 transitions. [2019-01-12 03:28:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-01-12 03:28:37,095 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:37,095 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2019-01-12 03:28:37,095 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:37,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:37,096 INFO L82 PathProgramCache]: Analyzing trace with hash 188469065, now seen corresponding path program 1 times [2019-01-12 03:28:37,097 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:37,097 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:37,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:37,098 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:37,098 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:37,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:28:37,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:37,513 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:28:37,514 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:28:37,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:28:37,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:37,518 INFO L87 Difference]: Start difference. First operand 421 states and 576 transitions. Second operand 4 states. [2019-01-12 03:28:40,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:40,250 INFO L93 Difference]: Finished difference Result 1257 states and 1864 transitions. [2019-01-12 03:28:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:28:40,251 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 228 [2019-01-12 03:28:40,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:40,258 INFO L225 Difference]: With dead ends: 1257 [2019-01-12 03:28:40,258 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:28:40,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:40,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:28:40,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 699. [2019-01-12 03:28:40,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 699 states. [2019-01-12 03:28:40,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 934 transitions. [2019-01-12 03:28:40,286 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 934 transitions. Word has length 228 [2019-01-12 03:28:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:40,287 INFO L480 AbstractCegarLoop]: Abstraction has 699 states and 934 transitions. [2019-01-12 03:28:40,287 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:28:40,287 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 934 transitions. [2019-01-12 03:28:40,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-12 03:28:40,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:40,293 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:40,293 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:40,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:40,293 INFO L82 PathProgramCache]: Analyzing trace with hash -252720925, now seen corresponding path program 1 times [2019-01-12 03:28:40,293 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:40,294 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:40,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:40,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:40,296 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:40,534 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 154 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:28:40,534 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:40,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:28:40,535 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:28:40,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:28:40,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:40,536 INFO L87 Difference]: Start difference. First operand 699 states and 934 transitions. Second operand 4 states. [2019-01-12 03:28:42,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:42,325 INFO L93 Difference]: Finished difference Result 1535 states and 2130 transitions. [2019-01-12 03:28:42,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:28:42,325 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 235 [2019-01-12 03:28:42,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:42,330 INFO L225 Difference]: With dead ends: 1535 [2019-01-12 03:28:42,330 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:28:42,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:42,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:28:42,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:28:42,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:28:42,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1212 transitions. [2019-01-12 03:28:42,352 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1212 transitions. Word has length 235 [2019-01-12 03:28:42,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:42,353 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1212 transitions. [2019-01-12 03:28:42,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:28:42,353 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1212 transitions. [2019-01-12 03:28:42,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-01-12 03:28:42,358 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:42,358 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:42,358 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1676503223, now seen corresponding path program 1 times [2019-01-12 03:28:42,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:42,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:42,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:42,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:42,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:42,589 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 163 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:28:42,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:42,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:28:42,590 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:28:42,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:28:42,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:28:42,590 INFO L87 Difference]: Start difference. First operand 977 states and 1212 transitions. Second operand 5 states. [2019-01-12 03:28:45,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:45,140 INFO L93 Difference]: Finished difference Result 3203 states and 4078 transitions. [2019-01-12 03:28:45,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:28:45,141 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 244 [2019-01-12 03:28:45,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:45,149 INFO L225 Difference]: With dead ends: 3203 [2019-01-12 03:28:45,149 INFO L226 Difference]: Without dead ends: 1255 [2019-01-12 03:28:45,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:28:45,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2019-01-12 03:28:45,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2019-01-12 03:28:45,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1255 states. [2019-01-12 03:28:45,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1469 transitions. [2019-01-12 03:28:45,180 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1469 transitions. Word has length 244 [2019-01-12 03:28:45,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:45,180 INFO L480 AbstractCegarLoop]: Abstraction has 1255 states and 1469 transitions. [2019-01-12 03:28:45,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:28:45,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1469 transitions. [2019-01-12 03:28:45,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2019-01-12 03:28:45,191 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:45,191 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:45,191 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:45,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:45,193 INFO L82 PathProgramCache]: Analyzing trace with hash 1970068201, now seen corresponding path program 1 times [2019-01-12 03:28:45,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:45,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:45,195 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:45,195 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:45,196 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:45,445 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 312 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:28:45,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:45,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:28:45,446 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 03:28:45,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 03:28:45,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:28:45,447 INFO L87 Difference]: Start difference. First operand 1255 states and 1469 transitions. Second operand 3 states. [2019-01-12 03:28:46,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:46,086 INFO L93 Difference]: Finished difference Result 3203 states and 3797 transitions. [2019-01-12 03:28:46,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 03:28:46,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 348 [2019-01-12 03:28:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:46,096 INFO L225 Difference]: With dead ends: 3203 [2019-01-12 03:28:46,097 INFO L226 Difference]: Without dead ends: 2089 [2019-01-12 03:28:46,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 03:28:46,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2019-01-12 03:28:46,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 2089. [2019-01-12 03:28:46,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2089 states. [2019-01-12 03:28:46,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2089 states to 2089 states and 2448 transitions. [2019-01-12 03:28:46,145 INFO L78 Accepts]: Start accepts. Automaton has 2089 states and 2448 transitions. Word has length 348 [2019-01-12 03:28:46,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:46,146 INFO L480 AbstractCegarLoop]: Abstraction has 2089 states and 2448 transitions. [2019-01-12 03:28:46,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 03:28:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 2089 states and 2448 transitions. [2019-01-12 03:28:46,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2019-01-12 03:28:46,153 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:46,153 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:46,154 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:46,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:46,154 INFO L82 PathProgramCache]: Analyzing trace with hash -276036492, now seen corresponding path program 1 times [2019-01-12 03:28:46,154 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:46,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:46,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:46,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:46,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:46,507 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 03:28:46,672 WARN L181 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-01-12 03:28:47,170 WARN L181 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 17 [2019-01-12 03:28:47,352 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-01-12 03:28:47,604 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 361 proven. 33 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-12 03:28:47,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:28:47,605 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:28:47,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:47,758 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:28:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 439 backedges. 314 proven. 80 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-01-12 03:28:48,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:28:48,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-01-12 03:28:48,989 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 03:28:48,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 03:28:48,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-01-12 03:28:48,997 INFO L87 Difference]: Start difference. First operand 2089 states and 2448 transitions. Second operand 9 states. [2019-01-12 03:28:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:52,172 INFO L93 Difference]: Finished difference Result 4508 states and 5314 transitions. [2019-01-12 03:28:52,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:28:52,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 378 [2019-01-12 03:28:52,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:52,186 INFO L225 Difference]: With dead ends: 4508 [2019-01-12 03:28:52,186 INFO L226 Difference]: Without dead ends: 2560 [2019-01-12 03:28:52,190 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 374 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2019-01-12 03:28:52,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2560 states. [2019-01-12 03:28:52,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2560 to 2367. [2019-01-12 03:28:52,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2367 states. [2019-01-12 03:28:52,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2367 states to 2367 states and 2738 transitions. [2019-01-12 03:28:52,248 INFO L78 Accepts]: Start accepts. Automaton has 2367 states and 2738 transitions. Word has length 378 [2019-01-12 03:28:52,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:52,249 INFO L480 AbstractCegarLoop]: Abstraction has 2367 states and 2738 transitions. [2019-01-12 03:28:52,249 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 03:28:52,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2367 states and 2738 transitions. [2019-01-12 03:28:52,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 401 [2019-01-12 03:28:52,257 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:28:52,257 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:28:52,257 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:28:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:28:52,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1254420789, now seen corresponding path program 1 times [2019-01-12 03:28:52,258 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:28:52,258 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:28:52,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:52,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:28:52,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:28:52,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:28:52,859 WARN L181 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 5 [2019-01-12 03:28:52,946 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2019-01-12 03:28:52,947 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:28:52,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:28:52,949 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:28:52,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:28:52,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:52,950 INFO L87 Difference]: Start difference. First operand 2367 states and 2738 transitions. Second operand 4 states. [2019-01-12 03:28:54,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:28:54,839 INFO L93 Difference]: Finished difference Result 5425 states and 6342 transitions. [2019-01-12 03:28:54,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:28:54,839 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 400 [2019-01-12 03:28:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:28:54,841 INFO L225 Difference]: With dead ends: 5425 [2019-01-12 03:28:54,841 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:28:54,847 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:28:54,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:28:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:28:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:28:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:28:54,848 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 400 [2019-01-12 03:28:54,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:28:54,849 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:28:54,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:28:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:28:54,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:28:54,856 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:28:54,903 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:28:54,949 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:28:55,401 WARN L181 SmtUtils]: Spent 431.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-12 03:28:55,874 WARN L181 SmtUtils]: Spent 471.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2019-01-12 03:28:55,891 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:28:55,894 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,894 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,894 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,894 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,894 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:28:55,895 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:28:55,896 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:28:55,897 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:28:55,897 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:28:55,904 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:28:55,904 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:28:55,904 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:28:55,904 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:28:55,904 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,905 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:28:55,906 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:28:55,913 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (or (<= (+ ~a1~0 551894) 0) (not (= 0 ~a10~0)) (not (= ~a19~0 6))) [2019-01-12 03:28:55,913 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:28:55,913 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:28:55,913 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:28:55,913 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:28:55,914 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:28:55,915 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:28:55,916 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:28:55,917 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:28:55,918 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:28:55,923 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,923 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,923 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,923 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,923 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:28:55,924 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:28:55,925 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (or (<= (+ ~a1~0 551894) 0) (not (= 0 ~a10~0)) (not (= ~a19~0 6))) [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:28:55,926 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:28:55,927 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:28:55,928 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,931 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:28:55,932 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:28:55,933 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:28:55,933 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,934 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:28:55,935 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:28:55,936 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:28:55,938 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,939 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,940 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,940 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,940 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,940 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:28:55,940 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:28:55,943 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:28:55,944 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:28:55,944 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:28:55,944 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 145) no Hoare annotation was computed. [2019-01-12 03:28:55,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:28:55 BoogieIcfgContainer [2019-01-12 03:28:55,977 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:28:55,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:28:55,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:28:55,978 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:28:55,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:28:31" (3/4) ... [2019-01-12 03:28:55,985 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:28:56,022 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:28:56,024 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:28:56,223 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:28:56,223 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:28:56,224 INFO L168 Benchmark]: Toolchain (without parser) took 28991.10 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 496.0 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -102.2 MB). Peak memory consumption was 393.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,225 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:28:56,226 INFO L168 Benchmark]: CACSL2BoogieTranslator took 731.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 MB in the end (delta: 28.2 MB). Peak memory consumption was 28.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,226 INFO L168 Benchmark]: Boogie Procedure Inliner took 179.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,227 INFO L168 Benchmark]: Boogie Preprocessor took 90.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:28:56,227 INFO L168 Benchmark]: RCFGBuilder took 2911.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.5 MB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,227 INFO L168 Benchmark]: TraceAbstraction took 24826.75 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 390.1 MB). Free memory was 976.5 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 283.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,228 INFO L168 Benchmark]: Witness Printer took 245.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. [2019-01-12 03:28:56,231 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 731.64 ms. Allocated memory is still 1.0 GB. Free memory was 947.3 MB in the beginning and 919.1 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 179.16 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 105.9 MB). Free memory was 919.1 MB in the beginning and 1.1 GB in the end (delta: -166.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.42 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2911.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 976.5 MB in the end (delta: 108.9 MB). Peak memory consumption was 108.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24826.75 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 390.1 MB). Free memory was 976.5 MB in the beginning and 1.1 GB in the end (delta: -106.9 MB). Peak memory consumption was 283.2 MB. Max. memory is 11.5 GB. * Witness Printer took 245.02 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 28.5 MB). Peak memory consumption was 28.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 145]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: (a1 + 551894 <= 0 || !(0 == a10)) || !(a19 == 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (a1 + 551894 <= 0 || !(0 == a10)) || !(a19 == 6) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 24.7s OverallTime, 8 OverallIterations, 4 TraceHistogramMax, 17.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 772 SDtfs, 2185 SDslu, 148 SDs, 0 SdLazy, 7170 SolverSat, 1296 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 421 GetRequests, 387 SyntacticMatches, 3 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2367occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 8 MinimizatonAttempts, 624 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 68 NumberOfFragments, 29 HoareAnnotationTreeSize, 3 FomulaSimplifications, 10265 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 80 FormulaSimplificationTreeSizeReductionInter, 0.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 2420 NumberOfCodeBlocks, 2420 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 2411 ConstructedInterpolants, 0 QuantifiedInterpolants, 3505625 SizeOfPredicates, 6 NumberOfNonLiveVariables, 497 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 9 InterpolantComputations, 7 PerfectInterpolantSequences, 2109/2222 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...