./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem01_label24_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem01_label24_true-unreach-call_false-termination.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c5fe2c6077c684b4b50af2f6570d6f5c736d513e .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-30 19:41:34,220 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-30 19:41:34,222 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-30 19:41:34,235 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-30 19:41:34,236 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-30 19:41:34,237 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-30 19:41:34,238 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-30 19:41:34,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-30 19:41:34,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-30 19:41:34,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-30 19:41:34,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-30 19:41:34,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-30 19:41:34,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-30 19:41:34,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-30 19:41:34,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-30 19:41:34,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-30 19:41:34,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-30 19:41:34,260 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-30 19:41:34,262 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-30 19:41:34,264 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-30 19:41:34,265 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-30 19:41:34,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-30 19:41:34,269 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-30 19:41:34,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-30 19:41:34,270 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-30 19:41:34,271 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-30 19:41:34,272 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-30 19:41:34,273 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-30 19:41:34,274 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-30 19:41:34,275 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-30 19:41:34,275 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-30 19:41:34,276 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-30 19:41:34,277 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-30 19:41:34,277 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-30 19:41:34,278 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-30 19:41:34,279 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-30 19:41:34,279 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-30 19:41:34,295 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-30 19:41:34,295 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-30 19:41:34,296 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-30 19:41:34,296 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-30 19:41:34,297 INFO L133 SettingsManager]: * Use SBE=true [2018-12-30 19:41:34,297 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-30 19:41:34,297 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-30 19:41:34,297 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-30 19:41:34,297 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-30 19:41:34,298 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-30 19:41:34,299 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-30 19:41:34,299 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-30 19:41:34,299 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-30 19:41:34,299 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-30 19:41:34,299 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-30 19:41:34,300 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-30 19:41:34,300 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-30 19:41:34,301 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-30 19:41:34,301 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-30 19:41:34,301 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-30 19:41:34,301 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-30 19:41:34,301 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-30 19:41:34,302 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-30 19:41:34,302 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-30 19:41:34,302 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-30 19:41:34,302 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-30 19:41:34,302 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-30 19:41:34,302 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-30 19:41:34,303 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 -> c5fe2c6077c684b4b50af2f6570d6f5c736d513e [2018-12-30 19:41:34,341 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-30 19:41:34,357 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-30 19:41:34,362 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-30 19:41:34,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-30 19:41:34,364 INFO L276 PluginConnector]: CDTParser initialized [2018-12-30 19:41:34,364 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem01_label24_true-unreach-call_false-termination.c [2018-12-30 19:41:34,430 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b623cb42/4291748a9ad64feb85640b94c0924584/FLAG2887f9281 [2018-12-30 19:41:34,999 INFO L307 CDTParser]: Found 1 translation units. [2018-12-30 19:41:35,000 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem01_label24_true-unreach-call_false-termination.c [2018-12-30 19:41:35,020 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b623cb42/4291748a9ad64feb85640b94c0924584/FLAG2887f9281 [2018-12-30 19:41:35,225 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b623cb42/4291748a9ad64feb85640b94c0924584 [2018-12-30 19:41:35,229 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-30 19:41:35,231 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-30 19:41:35,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:35,234 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-30 19:41:35,240 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-30 19:41:35,242 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:35" (1/1) ... [2018-12-30 19:41:35,245 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cd3e7f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:35, skipping insertion in model container [2018-12-30 19:41:35,246 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.12 07:41:35" (1/1) ... [2018-12-30 19:41:35,256 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-30 19:41:35,320 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-30 19:41:35,841 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:35,850 INFO L191 MainTranslator]: Completed pre-run [2018-12-30 19:41:35,994 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-30 19:41:36,016 INFO L195 MainTranslator]: Completed translation [2018-12-30 19:41:36,016 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36 WrapperNode [2018-12-30 19:41:36,017 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-30 19:41:36,018 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:36,018 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-30 19:41:36,018 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-30 19:41:36,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,141 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,203 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-30 19:41:36,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-30 19:41:36,204 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-30 19:41:36,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-30 19:41:36,216 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,221 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,249 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,269 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (1/1) ... [2018-12-30 19:41:36,284 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-30 19:41:36,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-30 19:41:36,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-30 19:41:36,285 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-30 19:41:36,290 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (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 [2018-12-30 19:41:36,384 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-30 19:41:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-30 19:41:40,154 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-30 19:41:40,154 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-30 19:41:40,155 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:40 BoogieIcfgContainer [2018-12-30 19:41:40,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-30 19:41:40,157 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-30 19:41:40,157 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-30 19:41:40,161 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-30 19:41:40,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.12 07:41:35" (1/3) ... [2018-12-30 19:41:40,162 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:40, skipping insertion in model container [2018-12-30 19:41:40,162 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.12 07:41:36" (2/3) ... [2018-12-30 19:41:40,164 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@46b10308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.12 07:41:40, skipping insertion in model container [2018-12-30 19:41:40,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:40" (3/3) ... [2018-12-30 19:41:40,166 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label24_true-unreach-call_false-termination.c [2018-12-30 19:41:40,179 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-30 19:41:40,190 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-30 19:41:40,212 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-30 19:41:40,269 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-30 19:41:40,270 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-30 19:41:40,270 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-30 19:41:40,270 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-30 19:41:40,271 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-30 19:41:40,271 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-30 19:41:40,271 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-30 19:41:40,271 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-30 19:41:40,271 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-30 19:41:40,308 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states. [2018-12-30 19:41:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-12-30 19:41:40,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:40,331 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:40,338 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:40,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:40,350 INFO L82 PathProgramCache]: Analyzing trace with hash -342959657, now seen corresponding path program 1 times [2018-12-30 19:41:40,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:40,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:40,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:40,407 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:40,407 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:40,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:40,970 WARN L181 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2018-12-30 19:41:41,008 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:41,012 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:41,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:41,018 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:41,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:41,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:41,038 INFO L87 Difference]: Start difference. First operand 198 states. Second operand 4 states. [2018-12-30 19:41:43,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:43,650 INFO L93 Difference]: Finished difference Result 687 states and 1203 transitions. [2018-12-30 19:41:43,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:43,653 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2018-12-30 19:41:43,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:43,681 INFO L225 Difference]: With dead ends: 687 [2018-12-30 19:41:43,683 INFO L226 Difference]: Without dead ends: 397 [2018-12-30 19:41:43,690 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:43,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-12-30 19:41:43,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 266. [2018-12-30 19:41:43,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-30 19:41:43,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2018-12-30 19:41:43,790 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 98 [2018-12-30 19:41:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:43,793 INFO L480 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2018-12-30 19:41:43,794 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:43,794 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2018-12-30 19:41:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-12-30 19:41:43,802 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:43,802 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:43,802 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:43,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:43,803 INFO L82 PathProgramCache]: Analyzing trace with hash 687887018, now seen corresponding path program 1 times [2018-12-30 19:41:43,803 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:43,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:43,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:43,807 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:43,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:43,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:44,054 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:44,054 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:44,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-30 19:41:44,056 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:44,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:44,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:44,058 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand 4 states. [2018-12-30 19:41:45,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:45,568 INFO L93 Difference]: Finished difference Result 1054 states and 1512 transitions. [2018-12-30 19:41:45,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:45,572 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 104 [2018-12-30 19:41:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:45,580 INFO L225 Difference]: With dead ends: 1054 [2018-12-30 19:41:45,580 INFO L226 Difference]: Without dead ends: 790 [2018-12-30 19:41:45,587 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 [2018-12-30 19:41:45,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2018-12-30 19:41:45,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2018-12-30 19:41:45,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 790 states. [2018-12-30 19:41:45,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 1068 transitions. [2018-12-30 19:41:45,654 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 1068 transitions. Word has length 104 [2018-12-30 19:41:45,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:45,655 INFO L480 AbstractCegarLoop]: Abstraction has 790 states and 1068 transitions. [2018-12-30 19:41:45,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:45,655 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 1068 transitions. [2018-12-30 19:41:45,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-30 19:41:45,662 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:45,662 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:45,662 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:45,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:45,663 INFO L82 PathProgramCache]: Analyzing trace with hash 61656490, now seen corresponding path program 1 times [2018-12-30 19:41:45,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:45,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:45,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:45,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:45,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-30 19:41:45,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:45,939 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:45,939 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:45,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:45,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:45,940 INFO L87 Difference]: Start difference. First operand 790 states and 1068 transitions. Second operand 4 states. [2018-12-30 19:41:48,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:48,239 INFO L93 Difference]: Finished difference Result 2626 states and 3534 transitions. [2018-12-30 19:41:48,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:48,242 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-12-30 19:41:48,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:48,252 INFO L225 Difference]: With dead ends: 2626 [2018-12-30 19:41:48,253 INFO L226 Difference]: Without dead ends: 1707 [2018-12-30 19:41:48,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:48,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2018-12-30 19:41:48,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1052. [2018-12-30 19:41:48,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-12-30 19:41:48,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1301 transitions. [2018-12-30 19:41:48,293 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1301 transitions. Word has length 105 [2018-12-30 19:41:48,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:48,293 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1301 transitions. [2018-12-30 19:41:48,294 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:48,294 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1301 transitions. [2018-12-30 19:41:48,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-12-30 19:41:48,298 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:48,298 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:48,299 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:48,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:48,299 INFO L82 PathProgramCache]: Analyzing trace with hash -320878716, now seen corresponding path program 1 times [2018-12-30 19:41:48,299 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:48,299 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:48,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:48,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:48,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:48,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:48,413 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-30 19:41:48,414 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:48,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:48,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:48,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:48,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:48,416 INFO L87 Difference]: Start difference. First operand 1052 states and 1301 transitions. Second operand 3 states. [2018-12-30 19:41:49,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:49,574 INFO L93 Difference]: Finished difference Result 2364 states and 2896 transitions. [2018-12-30 19:41:49,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:49,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2018-12-30 19:41:49,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:49,581 INFO L225 Difference]: With dead ends: 2364 [2018-12-30 19:41:49,582 INFO L226 Difference]: Without dead ends: 1183 [2018-12-30 19:41:49,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states. [2018-12-30 19:41:49,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1052. [2018-12-30 19:41:49,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1052 states. [2018-12-30 19:41:49,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1052 states to 1052 states and 1263 transitions. [2018-12-30 19:41:49,609 INFO L78 Accepts]: Start accepts. Automaton has 1052 states and 1263 transitions. Word has length 121 [2018-12-30 19:41:49,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:49,609 INFO L480 AbstractCegarLoop]: Abstraction has 1052 states and 1263 transitions. [2018-12-30 19:41:49,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:49,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1052 states and 1263 transitions. [2018-12-30 19:41:49,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-12-30 19:41:49,612 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:49,613 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:49,613 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:49,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:49,613 INFO L82 PathProgramCache]: Analyzing trace with hash 2118438855, now seen corresponding path program 1 times [2018-12-30 19:41:49,613 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:49,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:49,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:49,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:49,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:49,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2018-12-30 19:41:49,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:49,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:49,723 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:49,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:49,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:49,724 INFO L87 Difference]: Start difference. First operand 1052 states and 1263 transitions. Second operand 3 states. [2018-12-30 19:41:50,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:50,382 INFO L93 Difference]: Finished difference Result 2626 states and 3162 transitions. [2018-12-30 19:41:50,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:50,383 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 132 [2018-12-30 19:41:50,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:50,390 INFO L225 Difference]: With dead ends: 2626 [2018-12-30 19:41:50,391 INFO L226 Difference]: Without dead ends: 1445 [2018-12-30 19:41:50,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:50,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2018-12-30 19:41:50,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1314. [2018-12-30 19:41:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1314 states. [2018-12-30 19:41:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1455 transitions. [2018-12-30 19:41:50,420 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1455 transitions. Word has length 132 [2018-12-30 19:41:50,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:50,420 INFO L480 AbstractCegarLoop]: Abstraction has 1314 states and 1455 transitions. [2018-12-30 19:41:50,420 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:50,420 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1455 transitions. [2018-12-30 19:41:50,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-12-30 19:41:50,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:50,424 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:50,424 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:50,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:50,425 INFO L82 PathProgramCache]: Analyzing trace with hash -909410889, now seen corresponding path program 1 times [2018-12-30 19:41:50,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:50,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:50,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:50,426 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:50,426 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:50,525 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-12-30 19:41:50,526 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:50,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:50,526 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:50,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:50,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:50,528 INFO L87 Difference]: Start difference. First operand 1314 states and 1455 transitions. Second operand 3 states. [2018-12-30 19:41:51,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:51,355 INFO L93 Difference]: Finished difference Result 3281 states and 3647 transitions. [2018-12-30 19:41:51,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:51,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2018-12-30 19:41:51,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:51,364 INFO L225 Difference]: With dead ends: 3281 [2018-12-30 19:41:51,364 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:41:51,367 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:51,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:41:51,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1707. [2018-12-30 19:41:51,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2018-12-30 19:41:51,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 1884 transitions. [2018-12-30 19:41:51,402 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 1884 transitions. Word has length 151 [2018-12-30 19:41:51,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:51,402 INFO L480 AbstractCegarLoop]: Abstraction has 1707 states and 1884 transitions. [2018-12-30 19:41:51,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:51,403 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 1884 transitions. [2018-12-30 19:41:51,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-12-30 19:41:51,408 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:51,409 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:51,409 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:51,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:51,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1082991010, now seen corresponding path program 1 times [2018-12-30 19:41:51,409 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:51,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:51,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:51,413 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:51,413 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:51,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:51,550 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 19:41:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:51,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-30 19:41:51,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-30 19:41:51,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-30 19:41:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:51,553 INFO L87 Difference]: Start difference. First operand 1707 states and 1884 transitions. Second operand 3 states. [2018-12-30 19:41:52,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:52,195 INFO L93 Difference]: Finished difference Result 3674 states and 4051 transitions. [2018-12-30 19:41:52,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:41:52,196 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 154 [2018-12-30 19:41:52,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:52,204 INFO L225 Difference]: With dead ends: 3674 [2018-12-30 19:41:52,204 INFO L226 Difference]: Without dead ends: 1969 [2018-12-30 19:41:52,207 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-30 19:41:52,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2018-12-30 19:41:52,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1969. [2018-12-30 19:41:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2159 transitions. [2018-12-30 19:41:52,245 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2159 transitions. Word has length 154 [2018-12-30 19:41:52,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:52,245 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2159 transitions. [2018-12-30 19:41:52,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-30 19:41:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2159 transitions. [2018-12-30 19:41:52,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-12-30 19:41:52,251 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:52,251 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:52,252 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:52,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:52,252 INFO L82 PathProgramCache]: Analyzing trace with hash -162013546, now seen corresponding path program 1 times [2018-12-30 19:41:52,252 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:52,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:52,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:52,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:52,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:52,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:52,688 WARN L181 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 8 [2018-12-30 19:41:52,781 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2018-12-30 19:41:52,781 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:52,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-30 19:41:52,782 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:41:52,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:41:52,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:52,783 INFO L87 Difference]: Start difference. First operand 1969 states and 2159 transitions. Second operand 6 states. [2018-12-30 19:41:54,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:54,139 INFO L93 Difference]: Finished difference Result 3939 states and 4332 transitions. [2018-12-30 19:41:54,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-30 19:41:54,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 158 [2018-12-30 19:41:54,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:54,147 INFO L225 Difference]: With dead ends: 3939 [2018-12-30 19:41:54,148 INFO L226 Difference]: Without dead ends: 2103 [2018-12-30 19:41:54,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-12-30 19:41:54,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2103 states. [2018-12-30 19:41:54,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2103 to 1969. [2018-12-30 19:41:54,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:54,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2145 transitions. [2018-12-30 19:41:54,184 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2145 transitions. Word has length 158 [2018-12-30 19:41:54,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:54,184 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2145 transitions. [2018-12-30 19:41:54,184 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:41:54,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2145 transitions. [2018-12-30 19:41:54,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-12-30 19:41:54,190 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:54,190 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-30 19:41:54,190 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:54,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:54,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1222057446, now seen corresponding path program 1 times [2018-12-30 19:41:54,192 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:54,192 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:54,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:54,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:54,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:54,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:54,421 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 139 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2018-12-30 19:41:54,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:54,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:54,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:54,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:54,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:54,423 INFO L87 Difference]: Start difference. First operand 1969 states and 2145 transitions. Second operand 4 states. [2018-12-30 19:41:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:56,002 INFO L93 Difference]: Finished difference Result 4198 states and 4572 transitions. [2018-12-30 19:41:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:56,003 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 191 [2018-12-30 19:41:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:56,012 INFO L225 Difference]: With dead ends: 4198 [2018-12-30 19:41:56,012 INFO L226 Difference]: Without dead ends: 2100 [2018-12-30 19:41:56,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:56,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-12-30 19:41:56,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2018-12-30 19:41:56,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2103 transitions. [2018-12-30 19:41:56,051 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2103 transitions. Word has length 191 [2018-12-30 19:41:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:56,052 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2103 transitions. [2018-12-30 19:41:56,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2103 transitions. [2018-12-30 19:41:56,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-12-30 19:41:56,059 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:56,059 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-12-30 19:41:56,059 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1413978792, now seen corresponding path program 1 times [2018-12-30 19:41:56,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:56,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:56,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:56,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:56,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:56,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:56,325 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2018-12-30 19:41:56,326 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:56,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:41:56,327 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:41:56,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:41:56,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:41:56,329 INFO L87 Difference]: Start difference. First operand 1969 states and 2103 transitions. Second operand 4 states. [2018-12-30 19:41:58,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:58,240 INFO L93 Difference]: Finished difference Result 3936 states and 4206 transitions. [2018-12-30 19:41:58,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-30 19:41:58,241 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 197 [2018-12-30 19:41:58,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:58,248 INFO L225 Difference]: With dead ends: 3936 [2018-12-30 19:41:58,248 INFO L226 Difference]: Without dead ends: 2100 [2018-12-30 19:41:58,250 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 [2018-12-30 19:41:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2100 states. [2018-12-30 19:41:58,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2100 to 1969. [2018-12-30 19:41:58,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:58,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2102 transitions. [2018-12-30 19:41:58,284 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2102 transitions. Word has length 197 [2018-12-30 19:41:58,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:58,284 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2102 transitions. [2018-12-30 19:41:58,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:41:58,284 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2102 transitions. [2018-12-30 19:41:58,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-12-30 19:41:58,291 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:58,291 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-12-30 19:41:58,292 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:58,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:58,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1798112851, now seen corresponding path program 1 times [2018-12-30 19:41:58,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:58,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:58,295 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:58,295 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:41:58,535 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 188 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2018-12-30 19:41:58,536 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:41:58,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-30 19:41:58,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-30 19:41:58,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-30 19:41:58,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:58,537 INFO L87 Difference]: Start difference. First operand 1969 states and 2102 transitions. Second operand 6 states. [2018-12-30 19:41:59,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:41:59,721 INFO L93 Difference]: Finished difference Result 3971 states and 4248 transitions. [2018-12-30 19:41:59,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-30 19:41:59,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 218 [2018-12-30 19:41:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:41:59,728 INFO L225 Difference]: With dead ends: 3971 [2018-12-30 19:41:59,728 INFO L226 Difference]: Without dead ends: 2135 [2018-12-30 19:41:59,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-12-30 19:41:59,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2135 states. [2018-12-30 19:41:59,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2135 to 1969. [2018-12-30 19:41:59,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1969 states. [2018-12-30 19:41:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1969 states to 1969 states and 2088 transitions. [2018-12-30 19:41:59,769 INFO L78 Accepts]: Start accepts. Automaton has 1969 states and 2088 transitions. Word has length 218 [2018-12-30 19:41:59,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:41:59,769 INFO L480 AbstractCegarLoop]: Abstraction has 1969 states and 2088 transitions. [2018-12-30 19:41:59,769 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-30 19:41:59,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1969 states and 2088 transitions. [2018-12-30 19:41:59,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-12-30 19:41:59,776 INFO L394 BasicCegarLoop]: Found error trace [2018-12-30 19:41:59,777 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 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] [2018-12-30 19:41:59,777 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-30 19:41:59,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-30 19:41:59,777 INFO L82 PathProgramCache]: Analyzing trace with hash -392691734, now seen corresponding path program 1 times [2018-12-30 19:41:59,777 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-30 19:41:59,777 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-30 19:41:59,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:59,781 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-30 19:41:59,781 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-30 19:41:59,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-30 19:42:00,057 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 141 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2018-12-30 19:42:00,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-30 19:42:00,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-30 19:42:00,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-30 19:42:00,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-30 19:42:00,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-30 19:42:00,058 INFO L87 Difference]: Start difference. First operand 1969 states and 2088 transitions. Second operand 4 states. [2018-12-30 19:42:00,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-30 19:42:00,882 INFO L93 Difference]: Finished difference Result 3803 states and 4039 transitions. [2018-12-30 19:42:00,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-30 19:42:00,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 240 [2018-12-30 19:42:00,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-30 19:42:00,883 INFO L225 Difference]: With dead ends: 3803 [2018-12-30 19:42:00,884 INFO L226 Difference]: Without dead ends: 0 [2018-12-30 19:42:00,886 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 [2018-12-30 19:42:00,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-30 19:42:00,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-30 19:42:00,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-30 19:42:00,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-30 19:42:00,887 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 240 [2018-12-30 19:42:00,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-30 19:42:00,887 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-30 19:42:00,887 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-30 19:42:00,887 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-30 19:42:00,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-30 19:42:00,892 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-30 19:42:00,933 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,934 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,936 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,941 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,980 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,982 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:00,987 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-30 19:42:02,209 WARN L181 SmtUtils]: Spent 1.21 s on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-30 19:42:02,536 WARN L181 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 50 [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 390) no Hoare annotation was computed. [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L102(lines 102 390) no Hoare annotation was computed. [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L565-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L532-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L499-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,540 INFO L448 ceAbstractionStarter]: For program point L466-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L433-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L400-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L268(lines 268 390) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 390) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L566(line 566) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L533(line 533) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L500(line 500) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L467(line 467) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L434(line 434) no Hoare annotation was computed. [2018-12-30 19:42:02,541 INFO L448 ceAbstractionStarter]: For program point L401(line 401) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 390) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L72(lines 72 390) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L568-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L535-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L502-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L469-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L436-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L403-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,542 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 390) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 390) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L569(line 569) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L536(line 536) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L503(line 503) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L470(line 470) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L437(line 437) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L404(line 404) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L173(lines 173 390) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 390) no Hoare annotation was computed. [2018-12-30 19:42:02,543 INFO L448 ceAbstractionStarter]: For program point L372(lines 372 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L571-1(lines 571 573) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L538-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L505-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L472-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L439-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L406-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L208(lines 208 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 390) no Hoare annotation was computed. [2018-12-30 19:42:02,544 INFO L448 ceAbstractionStarter]: For program point L572(line 572) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L539(line 539) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L506(line 506) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L473(line 473) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L440(line 440) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L407(line 407) no Hoare annotation was computed. [2018-12-30 19:42:02,545 INFO L448 ceAbstractionStarter]: For program point L144(lines 144 390) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L444 ceAbstractionStarter]: At program point L574(lines 30 575) the Hoare annotation is: (let ((.cse9 (= ~a16~0 6)) (.cse11 (not (= ~a8~0 15)))) (let ((.cse8 (<= ~a17~0 0)) (.cse4 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse7 (= ~a16~0 4)) (.cse10 (= ~a16~0 5)) (.cse3 (= ~a21~0 1)) (.cse5 (or (= ~a8~0 13) (and (not .cse9) .cse11))) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a12~0 8)) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse5 .cse8) (and .cse0 .cse7 .cse8 .cse3 .cse6) (and .cse5 .cse9) (and .cse7 .cse8 .cse3 .cse4) (and .cse0 .cse3 .cse9 .cse4) (and .cse0 .cse3 .cse6 .cse9) (and .cse3 .cse4 .cse10) (and .cse0 .cse3 .cse6 .cse10) (and .cse0 .cse11 .cse10) (and .cse7 .cse5 .cse3 (not .cse1)) (and (and .cse11 .cse10) .cse3) (and .cse5 .cse1 .cse2 .cse6)))) [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L541-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L475-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L442-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L409-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L178(lines 178 390) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-12-30 19:42:02,546 INFO L448 ceAbstractionStarter]: For program point L509(line 509) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L476(line 476) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L443(line 443) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L410(line 410) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L245(lines 245 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L80(lines 80 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L448 ceAbstractionStarter]: For program point L114(lines 114 390) no Hoare annotation was computed. [2018-12-30 19:42:02,547 INFO L451 ceAbstractionStarter]: At program point L577(lines 577 594) the Hoare annotation is: true [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L544-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L511-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L478-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L445-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L412-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 390) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 390) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 390) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L512(line 512) no Hoare annotation was computed. [2018-12-30 19:42:02,548 INFO L448 ceAbstractionStarter]: For program point L479(line 479) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L446(line 446) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L413(line 413) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 470) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L84(lines 84 390) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L547-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L514-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L481-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,549 INFO L448 ceAbstractionStarter]: For program point L448-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L382(lines 382 390) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L415-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L316(lines 316 390) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L250(lines 250 390) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L515(line 515) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L482(line 482) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L449(line 449) no Hoare annotation was computed. [2018-12-30 19:42:02,550 INFO L448 ceAbstractionStarter]: For program point L416(line 416) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L318(lines 318 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L186(lines 186 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 390) no Hoare annotation was computed. [2018-12-30 19:42:02,551 INFO L448 ceAbstractionStarter]: For program point L550-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L444 ceAbstractionStarter]: At program point L583-2(lines 583 593) the Hoare annotation is: (let ((.cse9 (= ~a16~0 6)) (.cse11 (not (= ~a8~0 15)))) (let ((.cse8 (<= ~a17~0 0)) (.cse4 (<= ~a20~0 0)) (.cse0 (not (= ~a7~0 1))) (.cse7 (= ~a16~0 4)) (.cse10 (= ~a16~0 5)) (.cse3 (= ~a21~0 1)) (.cse5 (or (= ~a8~0 13) (and (not .cse9) .cse11))) (.cse1 (= ~a17~0 1)) (.cse2 (= ~a12~0 8)) (.cse6 (= ~a20~0 1))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 .cse4) (and .cse5 .cse3 .cse6) (and .cse7 .cse5 .cse8) (and .cse0 .cse7 .cse8 .cse3 .cse6) (and .cse5 .cse9) (and .cse7 .cse8 .cse3 .cse4) (and .cse0 .cse3 .cse9 .cse4) (and .cse0 .cse3 .cse6 .cse9) (and .cse3 .cse4 .cse10) (and .cse0 .cse3 .cse6 .cse10) (and .cse0 .cse11 .cse10) (and .cse7 .cse5 .cse3 (not .cse1)) (and (and .cse11 .cse10) .cse3) (and .cse5 .cse1 .cse2 .cse6)))) [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L517-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L484-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L451-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L418-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 390) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L518(line 518) no Hoare annotation was computed. [2018-12-30 19:42:02,552 INFO L448 ceAbstractionStarter]: For program point L485(line 485) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L452(line 452) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L419(line 419) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L353(lines 353 390) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 390) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L553-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L520-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L487-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L454-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L421-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,553 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 390) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L256(lines 256 390) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 390) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L124(lines 124 390) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L521(line 521) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L488(line 488) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L455(line 455) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L422(line 422) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L92(lines 92 390) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L588(line 588) no Hoare annotation was computed. [2018-12-30 19:42:02,554 INFO L448 ceAbstractionStarter]: For program point L324(lines 324 390) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L556-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L523-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L490-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L457-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 393) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L424-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 390) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L160(lines 160 390) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-30 19:42:02,555 INFO L448 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L524(line 524) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L491(line 491) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L458(line 458) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L425(line 425) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L392(line 392) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 390) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L62(lines 62 390) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 390) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 390) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L559-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L526-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,556 INFO L448 ceAbstractionStarter]: For program point L493-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L460-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L427-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 390) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L394-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 390) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 390) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L560(line 560) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L527(line 527) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L494(line 494) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L461(line 461) no Hoare annotation was computed. [2018-12-30 19:42:02,557 INFO L448 ceAbstractionStarter]: For program point L428(line 428) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L395(line 395) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L197(lines 197 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L363(lines 363 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 390) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L562-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,558 INFO L448 ceAbstractionStarter]: For program point L529-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L496-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L463-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L397-1(lines 30 575) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 390) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L563(line 563) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L530(line 530) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L497(line 497) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L464(line 464) no Hoare annotation was computed. [2018-12-30 19:42:02,559 INFO L448 ceAbstractionStarter]: For program point L431(line 431) no Hoare annotation was computed. [2018-12-30 19:42:02,560 INFO L448 ceAbstractionStarter]: For program point L398(line 398) no Hoare annotation was computed. [2018-12-30 19:42:02,560 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 390) no Hoare annotation was computed. [2018-12-30 19:42:02,560 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 390) no Hoare annotation was computed. [2018-12-30 19:42:02,560 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 390) no Hoare annotation was computed. [2018-12-30 19:42:02,589 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.12 07:42:02 BoogieIcfgContainer [2018-12-30 19:42:02,590 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-30 19:42:02,590 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-30 19:42:02,590 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-30 19:42:02,590 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-30 19:42:02,591 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.12 07:41:40" (3/4) ... [2018-12-30 19:42:02,595 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-30 19:42:02,641 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-30 19:42:02,644 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-30 19:42:02,855 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-30 19:42:02,855 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-30 19:42:02,860 INFO L168 Benchmark]: Toolchain (without parser) took 27629.94 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 375.9 MB). Free memory was 951.4 MB in the beginning and 1.3 GB in the end (delta: -363.9 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,860 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-30 19:42:02,861 INFO L168 Benchmark]: CACSL2BoogieTranslator took 783.62 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,861 INFO L168 Benchmark]: Boogie Procedure Inliner took 185.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,862 INFO L168 Benchmark]: Boogie Preprocessor took 81.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,862 INFO L168 Benchmark]: RCFGBuilder took 3870.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,862 INFO L168 Benchmark]: TraceAbstraction took 22432.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -331.9 MB). Peak memory consumption was 451.6 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,865 INFO L168 Benchmark]: Witness Printer took 265.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. [2018-12-30 19:42:02,869 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 783.62 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 913.8 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 185.52 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -205.6 MB). Peak memory consumption was 16.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 81.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3870.41 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 105.8 MB). Peak memory consumption was 105.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22432.94 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 243.3 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -331.9 MB). Peak memory consumption was 451.6 MB. Max. memory is 11.5 GB. * Witness Printer took 265.24 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 23.4 MB). Peak memory consumption was 23.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 470]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (((((((((((((((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0) || ((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a20 <= 0)) || (((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a21 == 1) && a20 == 1)) || ((a16 == 4 && (a8 == 13 || (!(a16 == 6) && !(a8 == 15)))) && a17 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a17 <= 0) && a21 == 1) && a20 == 1)) || ((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a16 == 6)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && !(a8 == 15)) && a16 == 5)) || (((a16 == 4 && (a8 == 13 || (!(a16 == 6) && !(a8 == 15)))) && a21 == 1) && !(a17 == 1))) || ((!(a8 == 15) && a16 == 5) && a21 == 1)) || ((((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a17 == 1) && a12 == 8) && a20 == 1) - InvariantResult [Line: 577]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 583]: Loop Invariant Derived loop invariant: (((((((((((((((((!(a7 == 1) && a17 == 1) && a12 == 8) && a21 == 1) && a20 <= 0) || ((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a20 <= 0)) || (((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a21 == 1) && a20 == 1)) || ((a16 == 4 && (a8 == 13 || (!(a16 == 6) && !(a8 == 15)))) && a17 <= 0)) || ((((!(a7 == 1) && a16 == 4) && a17 <= 0) && a21 == 1) && a20 == 1)) || ((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a16 == 6)) || (((a16 == 4 && a17 <= 0) && a21 == 1) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a16 == 6) && a20 <= 0)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 6)) || ((a21 == 1 && a20 <= 0) && a16 == 5)) || (((!(a7 == 1) && a21 == 1) && a20 == 1) && a16 == 5)) || ((!(a7 == 1) && !(a8 == 15)) && a16 == 5)) || (((a16 == 4 && (a8 == 13 || (!(a16 == 6) && !(a8 == 15)))) && a21 == 1) && !(a17 == 1))) || ((!(a8 == 15) && a16 == 5) && a21 == 1)) || ((((a8 == 13 || (!(a16 == 6) && !(a8 == 15))) && a17 == 1) && a12 == 8) && a20 == 1) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 1 error locations. SAFE Result, 22.3s OverallTime, 12 OverallIterations, 6 TraceHistogramMax, 16.7s AutomataDifference, 0.0s DeadEndRemovalTime, 1.6s HoareAnnotationTime, HoareTripleCheckerStatistics: 945 SDtfs, 2556 SDslu, 142 SDs, 0 SdLazy, 6367 SolverSat, 803 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 14.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 10 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1969occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 12 MinimizatonAttempts, 1872 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 46 NumberOfFragments, 491 HoareAnnotationTreeSize, 3 FomulaSimplifications, 2774 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 198 FormulaSimplificationTreeSizeReductionInter, 1.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 1869 NumberOfCodeBlocks, 1869 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1857 ConstructedInterpolants, 0 QuantifiedInterpolants, 671925 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 1309/1309 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...