./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 91b1670e 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/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.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 edfcf451b435e6b30ae37c75ee1e2f5c8348550f .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-91b1670 [2018-11-28 18:21:31,084 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 18:21:31,087 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 18:21:31,109 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 18:21:31,110 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 18:21:31,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 18:21:31,116 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 18:21:31,120 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 18:21:31,122 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 18:21:31,124 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 18:21:31,127 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 18:21:31,127 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 18:21:31,129 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 18:21:31,130 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 18:21:31,131 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 18:21:31,135 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 18:21:31,136 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 18:21:31,139 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 18:21:31,147 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 18:21:31,153 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 18:21:31,154 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 18:21:31,155 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 18:21:31,160 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 18:21:31,162 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 18:21:31,162 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 18:21:31,163 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 18:21:31,166 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 18:21:31,167 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 18:21:31,169 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 18:21:31,171 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 18:21:31,173 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 18:21:31,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 18:21:31,175 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 18:21:31,175 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 18:21:31,176 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 18:21:31,177 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 18:21:31,177 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 18:21:31,204 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 18:21:31,207 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 18:21:31,208 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 18:21:31,209 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 18:21:31,210 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 18:21:31,211 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 18:21:31,212 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 18:21:31,212 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 18:21:31,212 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 18:21:31,212 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 18:21:31,212 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 18:21:31,213 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 18:21:31,214 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 18:21:31,216 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 18:21:31,217 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 18:21:31,217 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 18:21:31,217 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 18:21:31,217 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 18:21:31,217 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:21:31,218 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 18:21:31,218 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 18:21:31,218 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 18:21:31,218 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 18:21:31,218 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 18:21:31,218 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 18:21:31,220 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 -> edfcf451b435e6b30ae37c75ee1e2f5c8348550f [2018-11-28 18:21:31,282 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 18:21:31,301 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 18:21:31,309 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 18:21:31,311 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 18:21:31,311 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 18:21:31,312 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-28 18:21:31,373 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6080f846/fcbe466d4d934f778355cc507e6b273d/FLAG7baf03468 [2018-11-28 18:21:31,881 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 18:21:31,882 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/loop-invgen/apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-28 18:21:31,891 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6080f846/fcbe466d4d934f778355cc507e6b273d/FLAG7baf03468 [2018-11-28 18:21:32,227 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6080f846/fcbe466d4d934f778355cc507e6b273d [2018-11-28 18:21:32,231 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 18:21:32,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 18:21:32,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 18:21:32,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 18:21:32,238 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 18:21:32,238 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,243 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1074d184 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32, skipping insertion in model container [2018-11-28 18:21:32,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,251 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 18:21:32,287 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 18:21:32,500 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:21:32,509 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 18:21:32,550 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 18:21:32,575 INFO L195 MainTranslator]: Completed translation [2018-11-28 18:21:32,576 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32 WrapperNode [2018-11-28 18:21:32,576 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 18:21:32,577 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 18:21:32,578 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 18:21:32,578 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 18:21:32,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,596 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 18:21:32,605 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 18:21:32,605 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 18:21:32,605 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 18:21:32,617 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,617 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,627 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,641 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... [2018-11-28 18:21:32,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 18:21:32,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 18:21:32,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 18:21:32,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 18:21:32,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 18:21:32,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 18:21:32,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 18:21:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 18:21:32,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 18:21:32,786 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 18:21:32,786 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 18:21:33,467 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 18:21:33,467 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 18:21:33,468 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:33 BoogieIcfgContainer [2018-11-28 18:21:33,468 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 18:21:33,469 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 18:21:33,469 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 18:21:33,482 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 18:21:33,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 06:21:32" (1/3) ... [2018-11-28 18:21:33,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3164e5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:33, skipping insertion in model container [2018-11-28 18:21:33,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 06:21:32" (2/3) ... [2018-11-28 18:21:33,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3164e5d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 06:21:33, skipping insertion in model container [2018-11-28 18:21:33,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:33" (3/3) ... [2018-11-28 18:21:33,491 INFO L112 eAbstractionObserver]: Analyzing ICFG apache-get-tag_true-unreach-call.i.v+nlh-reducer.c [2018-11-28 18:21:33,501 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 18:21:33,512 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-11-28 18:21:33,528 INFO L257 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2018-11-28 18:21:33,559 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 18:21:33,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 18:21:33,560 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 18:21:33,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 18:21:33,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 18:21:33,562 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 18:21:33,562 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 18:21:33,562 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 18:21:33,562 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 18:21:33,590 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2018-11-28 18:21:33,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 18:21:33,596 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:33,597 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:33,599 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:33,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:33,607 INFO L82 PathProgramCache]: Analyzing trace with hash -355727005, now seen corresponding path program 1 times [2018-11-28 18:21:33,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:33,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:33,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:33,865 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:33,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:21:33,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:21:33,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:21:33,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:21:33,884 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 5 states. [2018-11-28 18:21:34,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:34,482 INFO L93 Difference]: Finished difference Result 129 states and 172 transitions. [2018-11-28 18:21:34,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:21:34,484 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2018-11-28 18:21:34,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:34,499 INFO L225 Difference]: With dead ends: 129 [2018-11-28 18:21:34,499 INFO L226 Difference]: Without dead ends: 113 [2018-11-28 18:21:34,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:21:34,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-11-28 18:21:34,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 69. [2018-11-28 18:21:34,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-28 18:21:34,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2018-11-28 18:21:34,549 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 12 [2018-11-28 18:21:34,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:34,550 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2018-11-28 18:21:34,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:21:34,551 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2018-11-28 18:21:34,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-28 18:21:34,551 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:34,551 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:34,552 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:34,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:34,553 INFO L82 PathProgramCache]: Analyzing trace with hash -358961311, now seen corresponding path program 1 times [2018-11-28 18:21:34,553 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:34,553 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:34,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:34,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:34,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:34,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:34,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:34,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:34,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 18:21:34,622 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 18:21:34,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 18:21:34,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 18:21:34,623 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 4 states. [2018-11-28 18:21:34,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:34,781 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 18:21:34,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 18:21:34,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-28 18:21:34,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:34,785 INFO L225 Difference]: With dead ends: 69 [2018-11-28 18:21:34,785 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:21:34,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:21:34,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:21:34,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-11-28 18:21:34,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-11-28 18:21:34,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2018-11-28 18:21:34,800 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 12 [2018-11-28 18:21:34,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:34,801 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2018-11-28 18:21:34,801 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 18:21:34,801 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2018-11-28 18:21:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-28 18:21:34,802 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:34,802 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:34,803 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:34,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:34,804 INFO L82 PathProgramCache]: Analyzing trace with hash 1757104312, now seen corresponding path program 1 times [2018-11-28 18:21:34,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:34,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:34,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:34,806 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:34,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:34,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:34,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:34,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 18:21:34,941 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-28 18:21:34,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-28 18:21:34,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-28 18:21:34,943 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand 5 states. [2018-11-28 18:21:35,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:35,399 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2018-11-28 18:21:35,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:21:35,401 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-11-28 18:21:35,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:35,402 INFO L225 Difference]: With dead ends: 73 [2018-11-28 18:21:35,402 INFO L226 Difference]: Without dead ends: 71 [2018-11-28 18:21:35,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:21:35,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-11-28 18:21:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-11-28 18:21:35,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-11-28 18:21:35,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2018-11-28 18:21:35,412 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 13 [2018-11-28 18:21:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:35,412 INFO L480 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2018-11-28 18:21:35,412 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-28 18:21:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2018-11-28 18:21:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:21:35,414 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:35,414 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:35,415 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:35,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:35,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1775862844, now seen corresponding path program 1 times [2018-11-28 18:21:35,415 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:35,415 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:35,417 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:35,417 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:35,652 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:35,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:35,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:35,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:35,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:35,654 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand 6 states. [2018-11-28 18:21:36,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:36,107 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2018-11-28 18:21:36,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:36,109 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 18:21:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:36,111 INFO L225 Difference]: With dead ends: 107 [2018-11-28 18:21:36,111 INFO L226 Difference]: Without dead ends: 105 [2018-11-28 18:21:36,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:36,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-28 18:21:36,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 68. [2018-11-28 18:21:36,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-11-28 18:21:36,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2018-11-28 18:21:36,124 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 15 [2018-11-28 18:21:36,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:36,124 INFO L480 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2018-11-28 18:21:36,124 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:36,124 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2018-11-28 18:21:36,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 18:21:36,125 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:36,125 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:36,126 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:36,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:36,127 INFO L82 PathProgramCache]: Analyzing trace with hash 655192796, now seen corresponding path program 1 times [2018-11-28 18:21:36,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:36,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:36,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:36,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:36,213 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:36,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:36,214 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:36,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:36,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:36,215 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand 6 states. [2018-11-28 18:21:36,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:36,387 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-11-28 18:21:36,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:36,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-11-28 18:21:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:36,393 INFO L225 Difference]: With dead ends: 69 [2018-11-28 18:21:36,393 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:21:36,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:21:36,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-28 18:21:36,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-28 18:21:36,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2018-11-28 18:21:36,401 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 15 [2018-11-28 18:21:36,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:36,401 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2018-11-28 18:21:36,401 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:36,402 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2018-11-28 18:21:36,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:21:36,402 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:36,403 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:36,403 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:36,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:36,404 INFO L82 PathProgramCache]: Analyzing trace with hash 783259850, now seen corresponding path program 1 times [2018-11-28 18:21:36,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:36,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:36,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:36,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:36,601 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:36,601 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:36,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:36,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:36,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:36,602 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand 6 states. [2018-11-28 18:21:36,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:36,878 INFO L93 Difference]: Finished difference Result 146 states and 155 transitions. [2018-11-28 18:21:36,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:36,879 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 18:21:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:36,880 INFO L225 Difference]: With dead ends: 146 [2018-11-28 18:21:36,881 INFO L226 Difference]: Without dead ends: 144 [2018-11-28 18:21:36,881 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:36,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-11-28 18:21:36,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 64. [2018-11-28 18:21:36,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-28 18:21:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2018-11-28 18:21:36,889 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 16 [2018-11-28 18:21:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:36,890 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2018-11-28 18:21:36,890 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2018-11-28 18:21:36,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:21:36,891 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:36,891 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:36,892 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:36,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:36,893 INFO L82 PathProgramCache]: Analyzing trace with hash 782829867, now seen corresponding path program 1 times [2018-11-28 18:21:36,893 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:36,893 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:36,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:36,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:36,970 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:36,970 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:36,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:36,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:36,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:36,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:36,971 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 6 states. [2018-11-28 18:21:37,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:37,162 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2018-11-28 18:21:37,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:37,169 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 18:21:37,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:37,170 INFO L225 Difference]: With dead ends: 99 [2018-11-28 18:21:37,170 INFO L226 Difference]: Without dead ends: 95 [2018-11-28 18:21:37,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:37,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-28 18:21:37,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 60. [2018-11-28 18:21:37,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-28 18:21:37,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-11-28 18:21:37,178 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 16 [2018-11-28 18:21:37,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:37,178 INFO L480 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-11-28 18:21:37,178 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:37,179 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-11-28 18:21:37,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-28 18:21:37,179 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:37,180 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:37,180 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:37,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:37,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1163856723, now seen corresponding path program 1 times [2018-11-28 18:21:37,181 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:37,181 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:37,182 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:37,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:37,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:37,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:37,252 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:37,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:37,253 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:37,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:37,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:37,254 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 6 states. [2018-11-28 18:21:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:37,435 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-11-28 18:21:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:37,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-11-28 18:21:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:37,437 INFO L225 Difference]: With dead ends: 61 [2018-11-28 18:21:37,438 INFO L226 Difference]: Without dead ends: 57 [2018-11-28 18:21:37,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:37,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-28 18:21:37,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-28 18:21:37,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-28 18:21:37,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-11-28 18:21:37,446 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 16 [2018-11-28 18:21:37,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:37,446 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-11-28 18:21:37,446 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:37,450 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-11-28 18:21:37,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:21:37,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:37,451 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:37,454 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:37,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:37,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1488745224, now seen corresponding path program 1 times [2018-11-28 18:21:37,455 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:37,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:37,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:37,457 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:37,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:37,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:37,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:37,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:37,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 18:21:37,687 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:21:37,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:21:37,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:21:37,687 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 9 states. [2018-11-28 18:21:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:37,986 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2018-11-28 18:21:37,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:37,987 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 17 [2018-11-28 18:21:37,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:37,988 INFO L225 Difference]: With dead ends: 95 [2018-11-28 18:21:37,989 INFO L226 Difference]: Without dead ends: 93 [2018-11-28 18:21:37,989 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:37,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-11-28 18:21:37,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 54. [2018-11-28 18:21:37,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-28 18:21:37,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-11-28 18:21:37,996 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 17 [2018-11-28 18:21:37,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:37,996 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-11-28 18:21:37,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:21:37,996 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-11-28 18:21:37,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:21:37,997 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:37,997 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:37,998 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:37,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:37,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1705597714, now seen corresponding path program 1 times [2018-11-28 18:21:37,998 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:37,998 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,000 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:38,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:38,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:38,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:38,069 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:38,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:38,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:38,070 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 6 states. [2018-11-28 18:21:38,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:38,217 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2018-11-28 18:21:38,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:38,219 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 18:21:38,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:38,219 INFO L225 Difference]: With dead ends: 72 [2018-11-28 18:21:38,219 INFO L226 Difference]: Without dead ends: 70 [2018-11-28 18:21:38,220 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:38,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-28 18:21:38,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 52. [2018-11-28 18:21:38,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-11-28 18:21:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2018-11-28 18:21:38,228 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 17 [2018-11-28 18:21:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:38,229 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2018-11-28 18:21:38,229 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2018-11-28 18:21:38,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-28 18:21:38,230 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:38,230 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:38,233 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:38,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:38,235 INFO L82 PathProgramCache]: Analyzing trace with hash -1704058514, now seen corresponding path program 1 times [2018-11-28 18:21:38,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:38,235 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:38,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:38,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:38,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:38,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:38,312 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:38,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:38,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:38,314 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand 6 states. [2018-11-28 18:21:38,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:38,464 INFO L93 Difference]: Finished difference Result 53 states and 57 transitions. [2018-11-28 18:21:38,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:38,465 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-28 18:21:38,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:38,466 INFO L225 Difference]: With dead ends: 53 [2018-11-28 18:21:38,466 INFO L226 Difference]: Without dead ends: 51 [2018-11-28 18:21:38,467 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-28 18:21:38,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-11-28 18:21:38,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-11-28 18:21:38,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2018-11-28 18:21:38,473 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 17 [2018-11-28 18:21:38,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:38,473 INFO L480 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2018-11-28 18:21:38,473 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:38,473 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2018-11-28 18:21:38,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:21:38,474 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:38,474 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:38,475 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:38,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:38,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1087292366, now seen corresponding path program 1 times [2018-11-28 18:21:38,475 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:38,475 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:38,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:38,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:38,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:38,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-28 18:21:38,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-28 18:21:38,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-28 18:21:38,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-11-28 18:21:38,640 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand 9 states. [2018-11-28 18:21:38,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:38,909 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2018-11-28 18:21:38,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:38,910 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2018-11-28 18:21:38,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:38,911 INFO L225 Difference]: With dead ends: 51 [2018-11-28 18:21:38,911 INFO L226 Difference]: Without dead ends: 49 [2018-11-28 18:21:38,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2018-11-28 18:21:38,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-28 18:21:38,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2018-11-28 18:21:38,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-28 18:21:38,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 49 transitions. [2018-11-28 18:21:38,917 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 49 transitions. Word has length 18 [2018-11-28 18:21:38,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:38,917 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 49 transitions. [2018-11-28 18:21:38,917 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-28 18:21:38,917 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2018-11-28 18:21:38,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:21:38,918 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:38,918 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:38,919 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:38,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:38,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1332553060, now seen corresponding path program 1 times [2018-11-28 18:21:38,919 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:38,919 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,920 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:38,920 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:38,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:39,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:39,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:39,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:39,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:39,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:39,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:39,017 INFO L87 Difference]: Start difference. First operand 45 states and 49 transitions. Second operand 6 states. [2018-11-28 18:21:39,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:39,298 INFO L93 Difference]: Finished difference Result 69 states and 75 transitions. [2018-11-28 18:21:39,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:39,298 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-11-28 18:21:39,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:39,299 INFO L225 Difference]: With dead ends: 69 [2018-11-28 18:21:39,299 INFO L226 Difference]: Without dead ends: 67 [2018-11-28 18:21:39,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:39,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-28 18:21:39,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 43. [2018-11-28 18:21:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-28 18:21:39,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-28 18:21:39,304 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 18 [2018-11-28 18:21:39,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:39,305 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-28 18:21:39,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:39,305 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-28 18:21:39,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:21:39,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:39,307 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:39,308 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:39,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:39,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1333918480, now seen corresponding path program 1 times [2018-11-28 18:21:39,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:39,309 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:39,310 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:39,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:39,652 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-28 18:21:39,878 WARN L180 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-28 18:21:39,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:39,903 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:39,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:21:39,903 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:21:39,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:21:39,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:39,904 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 8 states. [2018-11-28 18:21:40,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:40,172 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2018-11-28 18:21:40,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:40,174 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 18:21:40,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:40,175 INFO L225 Difference]: With dead ends: 57 [2018-11-28 18:21:40,175 INFO L226 Difference]: Without dead ends: 55 [2018-11-28 18:21:40,176 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:21:40,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-28 18:21:40,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2018-11-28 18:21:40,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-28 18:21:40,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-11-28 18:21:40,181 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 18 [2018-11-28 18:21:40,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:40,181 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-11-28 18:21:40,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:21:40,181 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-11-28 18:21:40,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-28 18:21:40,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:40,182 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:40,183 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:40,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:40,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1286203230, now seen corresponding path program 1 times [2018-11-28 18:21:40,183 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:40,183 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:40,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:40,184 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:40,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:40,439 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-28 18:21:40,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:40,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:40,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:21:40,472 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:21:40,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:21:40,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:40,473 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 8 states. [2018-11-28 18:21:40,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:40,618 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2018-11-28 18:21:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 18:21:40,619 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-11-28 18:21:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:40,620 INFO L225 Difference]: With dead ends: 41 [2018-11-28 18:21:40,620 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 18:21:40,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2018-11-28 18:21:40,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 18:21:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-11-28 18:21:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-28 18:21:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-28 18:21:40,628 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 18 [2018-11-28 18:21:40,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:40,628 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-28 18:21:40,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:21:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-28 18:21:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-28 18:21:40,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:40,630 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 18:21:40,631 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:40,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1640531233, now seen corresponding path program 1 times [2018-11-28 18:21:40,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:40,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:40,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:40,936 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 7 [2018-11-28 18:21:41,187 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 11 DAG size of output: 8 [2018-11-28 18:21:41,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:41,216 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:41,216 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-28 18:21:41,217 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-28 18:21:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-28 18:21:41,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-11-28 18:21:41,217 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2018-11-28 18:21:41,479 WARN L180 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 11 [2018-11-28 18:21:41,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:41,637 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-28 18:21:41,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:41,640 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-11-28 18:21:41,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:41,642 INFO L225 Difference]: With dead ends: 52 [2018-11-28 18:21:41,642 INFO L226 Difference]: Without dead ends: 50 [2018-11-28 18:21:41,643 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2018-11-28 18:21:41,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-28 18:21:41,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2018-11-28 18:21:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-11-28 18:21:41,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2018-11-28 18:21:41,647 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 19 [2018-11-28 18:21:41,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:41,648 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2018-11-28 18:21:41,648 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-28 18:21:41,648 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2018-11-28 18:21:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-28 18:21:41,649 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:41,649 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] [2018-11-28 18:21:41,649 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:41,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:41,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1995308589, now seen corresponding path program 1 times [2018-11-28 18:21:41,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:41,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:41,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:41,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:41,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:41,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:41,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:41,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:41,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-28 18:21:41,933 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 18:21:41,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 18:21:41,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2018-11-28 18:21:41,934 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 7 states. [2018-11-28 18:21:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:42,148 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-11-28 18:21:42,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:42,150 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-11-28 18:21:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:42,151 INFO L225 Difference]: With dead ends: 39 [2018-11-28 18:21:42,151 INFO L226 Difference]: Without dead ends: 37 [2018-11-28 18:21:42,152 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:42,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-28 18:21:42,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2018-11-28 18:21:42,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-28 18:21:42,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-28 18:21:42,156 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 20 [2018-11-28 18:21:42,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:42,156 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-28 18:21:42,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 18:21:42,157 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-28 18:21:42,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-28 18:21:42,157 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 18:21:42,157 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] [2018-11-28 18:21:42,158 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 18:21:42,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 18:21:42,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1725020998, now seen corresponding path program 1 times [2018-11-28 18:21:42,158 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 18:21:42,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 18:21:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:42,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 18:21:42,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 18:21:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 18:21:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-28 18:21:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 18:21:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 18:21:42,322 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 18:21:42,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 18:21:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-28 18:21:42,324 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 6 states. [2018-11-28 18:21:42,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 18:21:42,426 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2018-11-28 18:21:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 18:21:42,427 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-28 18:21:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 18:21:42,427 INFO L225 Difference]: With dead ends: 37 [2018-11-28 18:21:42,427 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 18:21:42,428 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2018-11-28 18:21:42,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 18:21:42,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 18:21:42,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 18:21:42,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 18:21:42,429 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2018-11-28 18:21:42,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 18:21:42,429 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 18:21:42,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 18:21:42,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 18:21:42,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 18:21:42,435 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 18:21:42,482 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:42,508 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:42,528 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:42,548 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-28 18:21:42,916 WARN L180 SmtUtils]: Spent 291.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 8 [2018-11-28 18:21:43,349 WARN L180 SmtUtils]: Spent 432.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 13 [2018-11-28 18:21:43,661 WARN L180 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 14 [2018-11-28 18:21:43,819 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 14 [2018-11-28 18:21:43,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:43,822 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:43,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:43,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 18:21:43,822 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 18:21:43,822 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 18:21:43,822 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 363) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 10 370) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point L19(lines 19 364) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 138) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point L110(line 110) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point mainErr16ASSERT_VIOLATIONERROR_FUNCTION(line 346) no Hoare annotation was computed. [2018-11-28 18:21:43,823 INFO L448 ceAbstractionStarter]: For program point L284(lines 284 358) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L218(lines 218 240) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L78(lines 78 88) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L334(line 334) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L136(lines 136 158) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L37(lines 37 251) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L293(line 293) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 232) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L448 ceAbstractionStarter]: For program point L120(lines 120 197) no Hoare annotation was computed. [2018-11-28 18:21:43,824 INFO L451 ceAbstractionStarter]: At program point L310(lines 27 363) the Hoare annotation is: true [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 172) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point L211(lines 211 246) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 122) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 10 370) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 194) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point L261(lines 261 361) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 293) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L448 ceAbstractionStarter]: For program point L129(lines 129 196) no Hoare annotation was computed. [2018-11-28 18:21:43,825 INFO L444 ceAbstractionStarter]: At program point L352(lines 278 359) the Hoare annotation is: (and (not (= 0 main_~__VERIFIER_assert__cond~13)) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~12 1) (<= 0 main_~main__t~0)) [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point mainErr14ASSERT_VIOLATIONERROR_FUNCTION(line 305) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 10 370) the Hoare annotation is: true [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point L220(line 220) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point L344(lines 344 353) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L444 ceAbstractionStarter]: At program point L245(lines 97 247) the Hoare annotation is: (and (= main_~__VERIFIER_assert__cond~0 1) (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point mainErr15ASSERT_VIOLATIONERROR_FUNCTION(line 334) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-11-28 18:21:43,826 INFO L448 ceAbstractionStarter]: For program point L303(lines 303 311) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L138(line 138) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L39(line 39) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L97(lines 97 247) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 357) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L122(line 122) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 220) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L15(lines 15 369) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-28 18:21:43,827 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 51) no Hoare annotation was computed. [2018-11-28 18:21:43,832 INFO L448 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 274) no Hoare annotation was computed. [2018-11-28 18:21:43,832 INFO L448 ceAbstractionStarter]: For program point L230(lines 230 238) no Hoare annotation was computed. [2018-11-28 18:21:43,832 INFO L448 ceAbstractionStarter]: For program point L346(line 346) no Hoare annotation was computed. [2018-11-28 18:21:43,832 INFO L448 ceAbstractionStarter]: For program point L148(lines 148 156) no Hoare annotation was computed. [2018-11-28 18:21:43,832 INFO L448 ceAbstractionStarter]: For program point L49(lines 49 249) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L305(line 305) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L272(lines 272 359) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L66(lines 66 90) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L182(lines 182 192) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L108(lines 108 199) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point L232(line 232) no Hoare annotation was computed. [2018-11-28 18:21:43,833 INFO L444 ceAbstractionStarter]: At program point L323(lines 27 363) the Hoare annotation is: (and (<= (+ main_~main__t~0 1) main_~main__tagbuf_len~0) (<= 0 main_~main__t~0)) [2018-11-28 18:21:43,833 INFO L444 ceAbstractionStarter]: At program point L191(lines 55 249) the Hoare annotation is: (and (<= main_~main__t~0 main_~main__tagbuf_len~0) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~__VERIFIER_assert__cond~1)) (<= 1 main_~main__t~0)) [2018-11-28 18:21:43,833 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 184) no Hoare annotation was computed. [2018-11-28 18:21:43,834 INFO L448 ceAbstractionStarter]: For program point L150(line 150) no Hoare annotation was computed. [2018-11-28 18:21:43,841 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-11-28 18:21:43,841 INFO L448 ceAbstractionStarter]: For program point L274(line 274) no Hoare annotation was computed. [2018-11-28 18:21:43,841 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 110) no Hoare annotation was computed. [2018-11-28 18:21:43,841 INFO L448 ceAbstractionStarter]: For program point L332(lines 332 355) no Hoare annotation was computed. [2018-11-28 18:21:43,841 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 205) no Hoare annotation was computed. [2018-11-28 18:21:43,842 INFO L448 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-28 18:21:43,842 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 313) no Hoare annotation was computed. [2018-11-28 18:21:43,857 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 06:21:43 BoogieIcfgContainer [2018-11-28 18:21:43,857 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 18:21:43,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 18:21:43,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 18:21:43,858 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 18:21:43,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 06:21:33" (3/4) ... [2018-11-28 18:21:43,862 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-28 18:21:43,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-28 18:21:43,868 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-28 18:21:43,876 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-11-28 18:21:43,877 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-28 18:21:43,976 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-28 18:21:43,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 18:21:43,979 INFO L168 Benchmark]: Toolchain (without parser) took 11745.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 183.0 MB). Free memory was 954.0 MB in the beginning and 918.6 MB in the end (delta: 35.4 MB). Peak memory consumption was 218.4 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:43,980 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:43,980 INFO L168 Benchmark]: CACSL2BoogieTranslator took 343.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:43,980 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.55 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:43,981 INFO L168 Benchmark]: Boogie Preprocessor took 38.36 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 18:21:43,981 INFO L168 Benchmark]: RCFGBuilder took 821.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:43,981 INFO L168 Benchmark]: TraceAbstraction took 10388.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 926.6 MB in the end (delta: 143.8 MB). Peak memory consumption was 217.2 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:43,982 INFO L168 Benchmark]: Witness Printer took 118.20 ms. Allocated memory is still 1.2 GB. Free memory was 926.6 MB in the beginning and 918.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. [2018-11-28 18:21:43,986 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.16 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 343.16 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 937.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.55 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.36 ms. Allocated memory is still 1.0 GB. Free memory is still 937.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 821.05 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.6 MB). Free memory was 937.9 MB in the beginning and 1.1 GB in the end (delta: -132.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10388.68 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 73.4 MB). Free memory was 1.1 GB in the beginning and 926.6 MB in the end (delta: 143.8 MB). Peak memory consumption was 217.2 MB. Max. memory is 11.5 GB. * Witness Printer took 118.20 ms. Allocated memory is still 1.2 GB. Free memory was 926.6 MB in the beginning and 918.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 8.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 293]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 334]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 232]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 305]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 274]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 346]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 51]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 150]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 172]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 184]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 138]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 39]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 110]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 122]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 220]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 17 specifications checked. All of them hold - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: main__t + 1 <= main__tagbuf_len && 0 <= main__t - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((main__t <= main__tagbuf_len && __VERIFIER_assert__cond == 1) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 97]: Loop Invariant Derived loop invariant: ((__VERIFIER_assert__cond == 1 && main__t + 1 <= main__tagbuf_len) && !(0 == __VERIFIER_assert__cond)) && 1 <= main__t - InvariantResult [Line: 278]: Loop Invariant Derived loop invariant: ((!(0 == __VERIFIER_assert__cond) && main__t + 1 <= main__tagbuf_len) && __VERIFIER_assert__cond == 1) && 0 <= main__t - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 76 locations, 17 error locations. SAFE Result, 10.2s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 4.8s AutomataDifference, 0.0s DeadEndRemovalTime, 1.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 827 SDtfs, 1999 SDslu, 1410 SDs, 0 SdLazy, 1547 SolverSat, 217 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 192 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76occurred in iteration=0, 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.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 318 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 63 HoareAnnotationTreeSize, 9 FomulaSimplifications, 282753 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 9 FomulaSimplificationsInter, 149 FormulaSimplificationTreeSizeReductionInter, 1.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.3s InterpolantComputationTime, 298 NumberOfCodeBlocks, 298 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 11607 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...