./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/svcomp/c/eca-rers2012/Problem02_label26_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 ec64944e15cde20ad15af2bd0f0e78efc8184588 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 00:55:39,037 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 00:55:39,038 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 00:55:39,049 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 00:55:39,050 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 00:55:39,051 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 00:55:39,052 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 00:55:39,054 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 00:55:39,056 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 00:55:39,056 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 00:55:39,057 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 00:55:39,057 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 00:55:39,058 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 00:55:39,059 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 00:55:39,060 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 00:55:39,061 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 00:55:39,062 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 00:55:39,066 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 00:55:39,073 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 00:55:39,075 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 00:55:39,079 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 00:55:39,080 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 00:55:39,086 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 00:55:39,089 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 00:55:39,089 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 00:55:39,090 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 00:55:39,094 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 00:55:39,095 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 00:55:39,096 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 00:55:39,099 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 00:55:39,100 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 00:55:39,101 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 00:55:39,101 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 00:55:39,101 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 00:55:39,104 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 00:55:39,106 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 00:55:39,108 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 00:55:39,136 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 00:55:39,138 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 00:55:39,140 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 00:55:39,141 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 00:55:39,141 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 00:55:39,142 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 00:55:39,142 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 00:55:39,142 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 00:55:39,142 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 00:55:39,142 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 00:55:39,143 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 00:55:39,143 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 00:55:39,143 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 00:55:39,143 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 00:55:39,143 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 00:55:39,144 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 00:55:39,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 00:55:39,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 00:55:39,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 00:55:39,147 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 00:55:39,147 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 00:55:39,147 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:39,147 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 00:55:39,147 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 00:55:39,147 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 00:55:39,148 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 00:55:39,148 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 00:55:39,148 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 00:55:39,148 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 -> ec64944e15cde20ad15af2bd0f0e78efc8184588 [2019-01-12 00:55:39,209 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 00:55:39,228 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 00:55:39,233 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 00:55:39,234 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 00:55:39,235 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 00:55:39,236 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c [2019-01-12 00:55:39,297 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eede9a1/a853eff034414b8c9adf0af8be161c1c/FLAG240de88f3 [2019-01-12 00:55:39,814 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 00:55:39,814 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem02_label26_true-unreach-call_false-termination.c [2019-01-12 00:55:39,826 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eede9a1/a853eff034414b8c9adf0af8be161c1c/FLAG240de88f3 [2019-01-12 00:55:40,060 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9eede9a1/a853eff034414b8c9adf0af8be161c1c [2019-01-12 00:55:40,064 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 00:55:40,065 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 00:55:40,066 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:40,066 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 00:55:40,070 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 00:55:40,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,074 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65577392 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40, skipping insertion in model container [2019-01-12 00:55:40,074 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,081 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 00:55:40,146 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 00:55:40,583 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:40,595 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 00:55:40,748 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 00:55:40,776 INFO L195 MainTranslator]: Completed translation [2019-01-12 00:55:40,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40 WrapperNode [2019-01-12 00:55:40,777 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 00:55:40,778 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:40,778 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 00:55:40,778 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 00:55:40,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,885 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,972 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 00:55:40,972 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 00:55:40,973 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 00:55:40,973 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 00:55:40,988 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,988 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,997 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:40,998 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:41,045 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:41,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:41,071 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... [2019-01-12 00:55:41,079 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 00:55:41,079 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 00:55:41,080 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 00:55:41,080 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 00:55:41,081 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 00:55:41,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 00:55:41,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 00:55:44,495 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 00:55:44,496 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 00:55:44,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:44 BoogieIcfgContainer [2019-01-12 00:55:44,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 00:55:44,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 00:55:44,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 00:55:44,508 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 00:55:44,509 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 12:55:40" (1/3) ... [2019-01-12 00:55:44,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e00cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:44, skipping insertion in model container [2019-01-12 00:55:44,513 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 12:55:40" (2/3) ... [2019-01-12 00:55:44,513 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e00cf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 12:55:44, skipping insertion in model container [2019-01-12 00:55:44,514 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:44" (3/3) ... [2019-01-12 00:55:44,518 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label26_true-unreach-call_false-termination.c [2019-01-12 00:55:44,528 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 00:55:44,541 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 00:55:44,559 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 00:55:44,601 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 00:55:44,602 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 00:55:44,603 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 00:55:44,603 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 00:55:44,603 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 00:55:44,603 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 00:55:44,603 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 00:55:44,604 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 00:55:44,604 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 00:55:44,634 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2019-01-12 00:55:44,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-01-12 00:55:44,650 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:44,651 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:44,654 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:44,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:44,661 INFO L82 PathProgramCache]: Analyzing trace with hash 768814821, now seen corresponding path program 1 times [2019-01-12 00:55:44,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:44,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:44,715 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:44,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:44,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:44,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:45,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:45,273 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:45,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:45,279 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:45,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:45,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:45,297 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 4 states. [2019-01-12 00:55:47,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:47,715 INFO L93 Difference]: Finished difference Result 739 states and 1311 transitions. [2019-01-12 00:55:47,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:47,717 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-01-12 00:55:47,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:47,738 INFO L225 Difference]: With dead ends: 739 [2019-01-12 00:55:47,739 INFO L226 Difference]: Without dead ends: 445 [2019-01-12 00:55:47,744 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:47,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2019-01-12 00:55:47,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 445. [2019-01-12 00:55:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2019-01-12 00:55:47,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 664 transitions. [2019-01-12 00:55:47,815 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 664 transitions. Word has length 136 [2019-01-12 00:55:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:47,816 INFO L480 AbstractCegarLoop]: Abstraction has 445 states and 664 transitions. [2019-01-12 00:55:47,816 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 664 transitions. [2019-01-12 00:55:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-01-12 00:55:47,825 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:47,826 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:47,826 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:47,826 INFO L82 PathProgramCache]: Analyzing trace with hash -90241050, now seen corresponding path program 1 times [2019-01-12 00:55:47,826 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:47,827 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:47,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:47,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:47,964 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:47,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:47,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:47,966 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:47,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:47,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:47,967 INFO L87 Difference]: Start difference. First operand 445 states and 664 transitions. Second operand 4 states. [2019-01-12 00:55:49,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:49,208 INFO L93 Difference]: Finished difference Result 1470 states and 2193 transitions. [2019-01-12 00:55:49,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:49,209 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 154 [2019-01-12 00:55:49,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:49,222 INFO L225 Difference]: With dead ends: 1470 [2019-01-12 00:55:49,223 INFO L226 Difference]: Without dead ends: 1027 [2019-01-12 00:55:49,230 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:49,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2019-01-12 00:55:49,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 729. [2019-01-12 00:55:49,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 729 states. [2019-01-12 00:55:49,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1053 transitions. [2019-01-12 00:55:49,290 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1053 transitions. Word has length 154 [2019-01-12 00:55:49,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:49,290 INFO L480 AbstractCegarLoop]: Abstraction has 729 states and 1053 transitions. [2019-01-12 00:55:49,290 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:49,290 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1053 transitions. [2019-01-12 00:55:49,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 00:55:49,295 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:49,295 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:49,296 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:49,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:49,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1636593553, now seen corresponding path program 1 times [2019-01-12 00:55:49,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:49,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:49,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:49,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:49,631 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:49,632 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:49,632 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:49,632 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:49,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:49,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:49,633 INFO L87 Difference]: Start difference. First operand 729 states and 1053 transitions. Second operand 4 states. [2019-01-12 00:55:52,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:52,532 INFO L93 Difference]: Finished difference Result 2582 states and 3716 transitions. [2019-01-12 00:55:52,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 00:55:52,533 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 158 [2019-01-12 00:55:52,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:52,542 INFO L225 Difference]: With dead ends: 2582 [2019-01-12 00:55:52,543 INFO L226 Difference]: Without dead ends: 1855 [2019-01-12 00:55:52,545 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:52,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1855 states. [2019-01-12 00:55:52,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1855 to 1570. [2019-01-12 00:55:52,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-01-12 00:55:52,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2141 transitions. [2019-01-12 00:55:52,611 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2141 transitions. Word has length 158 [2019-01-12 00:55:52,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:52,612 INFO L480 AbstractCegarLoop]: Abstraction has 1570 states and 2141 transitions. [2019-01-12 00:55:52,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:52,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2141 transitions. [2019-01-12 00:55:52,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-01-12 00:55:52,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:52,617 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:52,617 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:52,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:52,617 INFO L82 PathProgramCache]: Analyzing trace with hash 1768582300, now seen corresponding path program 1 times [2019-01-12 00:55:52,618 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:52,618 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:52,619 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:52,619 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:52,708 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 00:55:52,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:52,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-12 00:55:52,709 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:52,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:52,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:52,710 INFO L87 Difference]: Start difference. First operand 1570 states and 2141 transitions. Second operand 3 states. [2019-01-12 00:55:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:53,617 INFO L93 Difference]: Finished difference Result 3840 states and 5193 transitions. [2019-01-12 00:55:53,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:53,618 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 158 [2019-01-12 00:55:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:53,628 INFO L225 Difference]: With dead ends: 3840 [2019-01-12 00:55:53,629 INFO L226 Difference]: Without dead ends: 2272 [2019-01-12 00:55:53,632 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2272 states. [2019-01-12 00:55:53,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2272 to 2272. [2019-01-12 00:55:53,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2272 states. [2019-01-12 00:55:53,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2272 states to 2272 states and 2838 transitions. [2019-01-12 00:55:53,673 INFO L78 Accepts]: Start accepts. Automaton has 2272 states and 2838 transitions. Word has length 158 [2019-01-12 00:55:53,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:53,674 INFO L480 AbstractCegarLoop]: Abstraction has 2272 states and 2838 transitions. [2019-01-12 00:55:53,674 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:53,674 INFO L276 IsEmpty]: Start isEmpty. Operand 2272 states and 2838 transitions. [2019-01-12 00:55:53,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-01-12 00:55:53,679 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:53,680 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:53,680 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:53,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:53,680 INFO L82 PathProgramCache]: Analyzing trace with hash 628642087, now seen corresponding path program 1 times [2019-01-12 00:55:53,680 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:53,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:53,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:53,682 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:53,682 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:53,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:53,882 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:55:53,883 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:53,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:53,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:53,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:53,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:53,884 INFO L87 Difference]: Start difference. First operand 2272 states and 2838 transitions. Second operand 3 states. [2019-01-12 00:55:54,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:54,472 INFO L93 Difference]: Finished difference Result 5381 states and 6669 transitions. [2019-01-12 00:55:54,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:54,473 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 163 [2019-01-12 00:55:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:54,485 INFO L225 Difference]: With dead ends: 5381 [2019-01-12 00:55:54,485 INFO L226 Difference]: Without dead ends: 2546 [2019-01-12 00:55:54,490 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2019-01-12 00:55:54,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2125. [2019-01-12 00:55:54,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2125 states. [2019-01-12 00:55:54,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2125 states to 2125 states and 2479 transitions. [2019-01-12 00:55:54,532 INFO L78 Accepts]: Start accepts. Automaton has 2125 states and 2479 transitions. Word has length 163 [2019-01-12 00:55:54,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:54,533 INFO L480 AbstractCegarLoop]: Abstraction has 2125 states and 2479 transitions. [2019-01-12 00:55:54,533 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:54,533 INFO L276 IsEmpty]: Start isEmpty. Operand 2125 states and 2479 transitions. [2019-01-12 00:55:54,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-01-12 00:55:54,540 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:54,540 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:54,541 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:54,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:54,541 INFO L82 PathProgramCache]: Analyzing trace with hash 984032927, now seen corresponding path program 1 times [2019-01-12 00:55:54,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:54,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:54,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:54,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:54,827 WARN L181 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 4 [2019-01-12 00:55:54,870 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-01-12 00:55:54,870 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:54,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 00:55:54,871 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 00:55:54,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 00:55:54,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:54,872 INFO L87 Difference]: Start difference. First operand 2125 states and 2479 transitions. Second operand 4 states. [2019-01-12 00:55:56,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:56,290 INFO L93 Difference]: Finished difference Result 4388 states and 5107 transitions. [2019-01-12 00:55:56,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:56,291 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 174 [2019-01-12 00:55:56,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:56,300 INFO L225 Difference]: With dead ends: 4388 [2019-01-12 00:55:56,300 INFO L226 Difference]: Without dead ends: 1985 [2019-01-12 00:55:56,304 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 00:55:56,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2019-01-12 00:55:56,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1705. [2019-01-12 00:55:56,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1705 states. [2019-01-12 00:55:56,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 1937 transitions. [2019-01-12 00:55:56,341 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 1937 transitions. Word has length 174 [2019-01-12 00:55:56,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:56,341 INFO L480 AbstractCegarLoop]: Abstraction has 1705 states and 1937 transitions. [2019-01-12 00:55:56,341 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 00:55:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 1937 transitions. [2019-01-12 00:55:56,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-01-12 00:55:56,376 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:56,376 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:56,377 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:56,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:56,377 INFO L82 PathProgramCache]: Analyzing trace with hash -1962121537, now seen corresponding path program 1 times [2019-01-12 00:55:56,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:56,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:56,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:56,378 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:56,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:56,492 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-01-12 00:55:56,492 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 00:55:56,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 00:55:56,493 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 00:55:56,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 00:55:56,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:56,494 INFO L87 Difference]: Start difference. First operand 1705 states and 1937 transitions. Second operand 3 states. [2019-01-12 00:55:57,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:55:57,439 INFO L93 Difference]: Finished difference Result 3411 states and 3863 transitions. [2019-01-12 00:55:57,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 00:55:57,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 187 [2019-01-12 00:55:57,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:55:57,447 INFO L225 Difference]: With dead ends: 3411 [2019-01-12 00:55:57,447 INFO L226 Difference]: Without dead ends: 1707 [2019-01-12 00:55:57,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 00:55:57,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2019-01-12 00:55:57,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1703. [2019-01-12 00:55:57,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-01-12 00:55:57,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 1867 transitions. [2019-01-12 00:55:57,481 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 1867 transitions. Word has length 187 [2019-01-12 00:55:57,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:55:57,481 INFO L480 AbstractCegarLoop]: Abstraction has 1703 states and 1867 transitions. [2019-01-12 00:55:57,482 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 00:55:57,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 1867 transitions. [2019-01-12 00:55:57,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2019-01-12 00:55:57,488 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 00:55:57,489 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 00:55:57,489 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 00:55:57,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 00:55:57,489 INFO L82 PathProgramCache]: Analyzing trace with hash -747241302, now seen corresponding path program 1 times [2019-01-12 00:55:57,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 00:55:57,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 00:55:57,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:57,491 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:57,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 00:55:57,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:57,912 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 125 proven. 3 refuted. 0 times theorem prover too weak. 140 trivial. 0 not checked. [2019-01-12 00:55:57,913 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 00:55:57,913 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 00:55:57,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 00:55:58,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 00:55:58,060 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 00:55:58,215 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-01-12 00:55:58,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 00:55:58,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 8 [2019-01-12 00:55:58,239 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 00:55:58,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 00:55:58,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-01-12 00:55:58,239 INFO L87 Difference]: Start difference. First operand 1703 states and 1867 transitions. Second operand 8 states. [2019-01-12 00:56:02,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 00:56:02,218 INFO L93 Difference]: Finished difference Result 4000 states and 4372 transitions. [2019-01-12 00:56:02,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 00:56:02,218 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 281 [2019-01-12 00:56:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 00:56:02,219 INFO L225 Difference]: With dead ends: 4000 [2019-01-12 00:56:02,219 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 00:56:02,222 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 286 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=66, Invalid=116, Unknown=0, NotChecked=0, Total=182 [2019-01-12 00:56:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 00:56:02,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 00:56:02,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 00:56:02,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 00:56:02,223 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 281 [2019-01-12 00:56:02,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 00:56:02,224 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 00:56:02,224 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 00:56:02,224 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 00:56:02,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 00:56:02,229 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 00:56:02,279 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:02,330 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 00:56:03,201 WARN L181 SmtUtils]: Spent 837.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-01-12 00:56:03,440 WARN L181 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2019-01-12 00:56:03,443 INFO L448 ceAbstractionStarter]: For program point L564-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,443 INFO L448 ceAbstractionStarter]: For program point L498-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L432-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 413) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L565(line 565) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L499(line 499) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L433(line 433) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L169(lines 169 413) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L368(lines 368 413) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 413) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L567-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,444 INFO L448 ceAbstractionStarter]: For program point L501-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L435-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L237(lines 237 413) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L568(line 568) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L502(line 502) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L436(line 436) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L238(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L238-2(lines 238 246) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L106(lines 106 413) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L570-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,445 INFO L448 ceAbstractionStarter]: For program point L504-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L438-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L42(lines 42 413) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L571(line 571) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L505(line 505) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L439(line 439) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 413) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L573-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L507-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L441-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 413) no Hoare annotation was computed. [2019-01-12 00:56:03,446 INFO L448 ceAbstractionStarter]: For program point L309(lines 309 413) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L574(line 574) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L508(line 508) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L442(line 442) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L179(lines 179 413) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 413) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L47(lines 47 413) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L576-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L510-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,447 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 413) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L577(line 577) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L511(line 511) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L445(line 445) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 413) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L314(lines 314 413) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L248(lines 248 413) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L50(lines 50 413) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L579-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L513-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L447-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,448 INFO L448 ceAbstractionStarter]: For program point L381(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L315(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L381-2(lines 381 387) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L315-2(lines 315 326) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L580(line 580) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L514(line 514) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L448(line 448) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L185(lines 185 413) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 413) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L582-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L516-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,449 INFO L448 ceAbstractionStarter]: For program point L450-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L54(lines 54 413) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L583(line 583) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L517(line 517) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L451(line 451) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 413) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L187(lines 187 413) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L585-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L519-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L453-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,450 INFO L448 ceAbstractionStarter]: For program point L189(lines 189 413) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L123(lines 123 413) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L586(line 586) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L520(line 520) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L454(line 454) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L389(lines 389 413) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 413) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L59(lines 59 413) no Hoare annotation was computed. [2019-01-12 00:56:03,451 INFO L448 ceAbstractionStarter]: For program point L588-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L522-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L456-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L589(line 589) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L523(line 523) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L457(line 457) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L259(lines 259 413) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L194(lines 194 413) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L591-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L525-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,452 INFO L448 ceAbstractionStarter]: For program point L459-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 413) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L592(line 592) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L526(line 526) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L460(line 460) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L394(lines 394 413) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L328(lines 328 413) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L262(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L262-2(lines 262 274) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L130(lines 130 413) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L65(lines 65 413) no Hoare annotation was computed. [2019-01-12 00:56:03,453 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L594-1(lines 594 596) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L528-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L462-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L198(lines 198 413) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L595(line 595) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L529(line 529) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L463(line 463) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 413) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 413) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:03,454 INFO L448 ceAbstractionStarter]: For program point L332-2(lines 332 335) no Hoare annotation was computed. [2019-01-12 00:56:03,455 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 413) no Hoare annotation was computed. [2019-01-12 00:56:03,455 INFO L444 ceAbstractionStarter]: At program point L597(lines 29 598) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse5 (not (= ~a28~0 11))) (.cse3 (= ~a19~0 1)) (.cse11 (not .cse7)) (.cse10 (= ~a11~0 1))) (let ((.cse6 (or (and .cse11 .cse10 .cse5) (and .cse3 .cse11 .cse10))) (.cse9 (<= 10 ~a28~0)) (.cse4 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse0 (<= ~a19~0 0)) (.cse1 (and .cse11 .cse2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6) (and .cse2 .cse3 .cse7) (and .cse8 .cse0) (and .cse9 .cse6) (and .cse9 .cse3 .cse7) (and .cse3 .cse10 .cse4 .cse7) (and .cse8 .cse2 .cse10) (and .cse0 .cse2 .cse5) (and .cse1 .cse10 .cse5))))) [2019-01-12 00:56:03,455 INFO L448 ceAbstractionStarter]: For program point L531-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,455 INFO L448 ceAbstractionStarter]: For program point L465-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,455 INFO L448 ceAbstractionStarter]: For program point L69(lines 69 413) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L532(line 532) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L466(line 466) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L202(lines 202 413) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L203(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L203-2(lines 203 210) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L451 ceAbstractionStarter]: At program point L600(lines 600 617) the Hoare annotation is: true [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L534-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L468-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L402(lines 402 413) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L535(line 535) no Hoare annotation was computed. [2019-01-12 00:56:03,456 INFO L448 ceAbstractionStarter]: For program point L469(line 469) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L337(lines 337 413) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L139(lines 139 413) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 413) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L338(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L338-2(lines 338 347) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L74(lines 74 413) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L537-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L471-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L75(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:03,457 INFO L448 ceAbstractionStarter]: For program point L75-2(lines 75 80) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L538(line 538) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L472(line 472) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L407(lines 407 413) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 413) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L444 ceAbstractionStarter]: At program point L606-2(lines 606 616) the Hoare annotation is: (let ((.cse7 (= ~a25~0 1))) (let ((.cse2 (= ~a17~0 8)) (.cse5 (not (= ~a28~0 11))) (.cse3 (= ~a19~0 1)) (.cse11 (not .cse7)) (.cse10 (= ~a11~0 1))) (let ((.cse6 (or (and .cse11 .cse10 .cse5) (and .cse3 .cse11 .cse10))) (.cse9 (<= 10 ~a28~0)) (.cse4 (= ~a21~0 1)) (.cse8 (= ~a28~0 9)) (.cse0 (<= ~a19~0 0)) (.cse1 (and .cse11 .cse2))) (or (and .cse0 .cse1) (and .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse6) (and .cse2 .cse3 .cse7) (and .cse8 .cse0) (and .cse9 .cse6) (and .cse9 .cse3 .cse7) (and .cse3 .cse10 .cse4 .cse7) (and .cse8 .cse2 .cse10) (and .cse0 .cse2 .cse5) (and .cse1 .cse10 .cse5))))) [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L474-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L276(lines 276 413) no Hoare annotation was computed. [2019-01-12 00:56:03,458 INFO L448 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L475(line 475) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L409(lines 409 413) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L212(lines 212 413) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L543-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L477-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L478(line 478) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L280(lines 280 413) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 413) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L82(lines 82 413) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L611(line 611) no Hoare annotation was computed. [2019-01-12 00:56:03,459 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 413) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L83(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L83-2(lines 83 89) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L546-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L480-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 416) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L414-2(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L481(line 481) no Hoare annotation was computed. [2019-01-12 00:56:03,460 INFO L448 ceAbstractionStarter]: For program point L415(line 415) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L349(lines 349 413) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 413) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 413) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L549-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L483-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L417-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L484(line 484) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L418(line 418) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 413) no Hoare annotation was computed. [2019-01-12 00:56:03,461 INFO L448 ceAbstractionStarter]: For program point L154(lines 154 413) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L552-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L486-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L420-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 413) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L553(line 553) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L487(line 487) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L421(line 421) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L223(lines 223 413) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L91(lines 91 413) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L555-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,462 INFO L448 ceAbstractionStarter]: For program point L489-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L423-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 413) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 413) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L159(lines 159 413) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L490(line 490) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L424(line 424) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L293(lines 293 413) no Hoare annotation was computed. [2019-01-12 00:56:03,463 INFO L448 ceAbstractionStarter]: For program point L95(lines 95 413) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L558-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L426-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L30(lines 30 413) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L559(line 559) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L493(line 493) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L427(line 427) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 413) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L561-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L495-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,464 INFO L448 ceAbstractionStarter]: For program point L429-1(lines 29 598) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L297(lines 297 413) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L165(lines 165 413) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L99(lines 99 413) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L562(line 562) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L496(line 496) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L430(line 430) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L298(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L232(lines 232 413) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L298-2(lines 298 307) no Hoare annotation was computed. [2019-01-12 00:56:03,465 INFO L448 ceAbstractionStarter]: For program point L35(lines 35 413) no Hoare annotation was computed. [2019-01-12 00:56:03,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 12:56:03 BoogieIcfgContainer [2019-01-12 00:56:03,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 00:56:03,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 00:56:03,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 00:56:03,488 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 00:56:03,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 12:55:44" (3/4) ... [2019-01-12 00:56:03,492 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 00:56:03,515 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 00:56:03,516 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 00:56:03,720 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 00:56:03,721 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 00:56:03,722 INFO L168 Benchmark]: Toolchain (without parser) took 23657.62 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 380.1 MB). Free memory was 946.0 MB in the beginning and 998.1 MB in the end (delta: -52.1 MB). Peak memory consumption was 328.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,722 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 00:56:03,723 INFO L168 Benchmark]: CACSL2BoogieTranslator took 710.99 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. [2019-01-12 00:56:03,723 INFO L168 Benchmark]: Boogie Procedure Inliner took 194.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -222.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,723 INFO L168 Benchmark]: Boogie Preprocessor took 106.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,725 INFO L168 Benchmark]: RCFGBuilder took 3422.74 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,726 INFO L168 Benchmark]: TraceAbstraction took 18983.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.7 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,727 INFO L168 Benchmark]: Witness Printer took 233.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2019-01-12 00:56:03,730 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 710.99 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 194.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.9 MB). Free memory was 913.8 MB in the beginning and 1.1 GB in the end (delta: -222.2 MB). Peak memory consumption was 16.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 106.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 3422.74 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: 97.6 MB). Peak memory consumption was 97.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 18983.11 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 231.2 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 22.7 MB). Peak memory consumption was 253.9 MB. Max. memory is 11.5 GB. * Witness Printer took 233.43 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 998.1 MB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 606]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (((a19 == 1 && a11 == 1) && a21 == 1) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11)) - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: ((((((((((a19 <= 0 && !(a25 == 1) && a17 == 8) || (((a17 == 8 && a19 == 1) && a21 == 1) && !(a28 == 11))) || (a19 <= 0 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((a17 == 8 && a19 == 1) && a25 == 1)) || (a28 == 9 && a19 <= 0)) || (10 <= a28 && (((!(a25 == 1) && a11 == 1) && !(a28 == 11)) || ((a19 == 1 && !(a25 == 1)) && a11 == 1)))) || ((10 <= a28 && a19 == 1) && a25 == 1)) || (((a19 == 1 && a11 == 1) && a21 == 1) && a25 == 1)) || ((a28 == 9 && a17 == 8) && a11 == 1)) || ((a19 <= 0 && a17 == 8) && !(a28 == 11))) || (((!(a25 == 1) && a17 == 8) && a11 == 1) && !(a28 == 11)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. SAFE Result, 18.8s OverallTime, 8 OverallIterations, 5 TraceHistogramMax, 14.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 989 SDtfs, 2212 SDslu, 285 SDs, 0 SdLazy, 5725 SolverSat, 946 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 323 GetRequests, 297 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2272occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 8 MinimizatonAttempts, 1288 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 78 NumberOfFragments, 321 HoareAnnotationTreeSize, 3 FomulaSimplifications, 1518 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 580 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 1692 NumberOfCodeBlocks, 1692 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1683 ConstructedInterpolants, 0 QuantifiedInterpolants, 626270 SizeOfPredicates, 1 NumberOfNonLiveVariables, 445 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 9 InterpolantComputations, 8 PerfectInterpolantSequences, 770/773 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...